Immerman–Szelepcsényi theorem

#	Item
1	PDF Document Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-12-06 15:39:06 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Network flow NP-complete problems Graph theory Immerman–Szelepcsényi theorem Push-relabel maximum flow algorithm Theoretical computer science Computational complexity theory Mathematics
2	Distrib. Comput[removed]DOI[removed]s00446[removed]SPECIAL ISSUE: DISC 04 Hagit Attiya · Fabian Kuhn · C. Greg Plaxton · Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2010-04-22 04:44:55 Analysis of algorithms Probabilistic complexity theory Randomized algorithm SL Time complexity Matching Algorithm Algorithmic Lovász local lemma Immerman–Szelepcsényi theorem Theoretical computer science Computational complexity theory Applied mathematics
3	Efficient Adaptive Collect using Randomization Hagit Attiya1 , Fabian Kuhn2 , Mirjam Wattenhofer2 , and Roger Wattenhofer2 1 2 Department of Computer Science, Technion Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-08-13 15:01:47 Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm SL Immerman–Szelepcsényi theorem In-place algorithm Theoretical computer science Applied mathematics Analysis of algorithms