User:SuggestBot/Suggestions for Devanden

Hello, Devanden. Based on things you've edited in the past, here are some articles you might be interested in contributing to.

St-non-connectivity Co-RE MAX-3LIN-EQN Connectivity (graph theory) Co-RE-complete MAX-3SAT(13) Immerman-Szelepcsényi theorem PR (complexity) Immerman-Szelepcsényi theorem Connectivity BPP Valiant-Vazirani theorem Toy theorem IP (complexity) Róbert Szelepcsényi Gap theorem R (complexity) NL (complexity) Savitch's theorem RE (complexity) Leslie Valiant Compression theorem PH (complexity) Neil Immerman Blum's speedup theorem L (complexity) Vijay Vazirani Algebraic connectivity ZPP MAX-Clique

If you have comments about these recommendations, or other suggestions for how to help match people with work to do in Wikipedia, please tell me by leaving comments below. I hope you find these suggestions useful. -- SuggestBot 01:41, 13 January 2006 (UTC)