Search results

function Christos Papadimitriou, Computational Complexity (1994), ISBN 978-0-201-53082-7. Section 20.1, corollary 3, page 495. Fischer, M. J., and Michael...

1007/978-3-540-31834-7_5. ISBN 978-3-540-31834-7. Papadimitriou, Christos H. (1994). Computational complexity. Reading (Mass): Addison-Wesley. ISBN 978-0-201-53082-7....

75–87. Christos Papadimitriou, Computational Complexity (1994), ISBN 978-0-201-53082-7. Section 20.1, corollary 3, page 495. Fischer, M. J., and Michael...

(1994). Computational complexity. Reading, Mass.: Addison–Wesley. ISBN 978-0-201-53082-7. Sipser, Michael (2006). Introduction to the Theory of Computation...

(1993). Computational Complexity (1st ed.). Addison Wesley. ISBN 978-0-201-53082-7. Section 16.2: Alternation, pp. 399–401. Bakhadyr Khoussainov; Anil...

Computational Complexity (1st ed.). Addison Wesley. pp. 375–381. ISBN 978-0-201-53082-7. Kozen, Dexter (2006). "Lecture 12: Relation of NC to Time-Space Classes"...

Computational complexity. Reading, Massachusetts: Addison-Wesley. ISBN 978-0-201-53082-7. Rogers, Hartley (1 April 1967). Theory of recursive functions and...

Christos Papadimitriou (1993). Computational Complexity (1st ed.). Addison Wesley. ISBN 978-0-201-53082-7. Section 12.1: One-way functions, pp. 279–298....

(1993). Computational Complexity (1st ed.). Addison Wesley. ISBN 978-0-201-53082-7. Section 19.2: Games against nature and interactive protocols, pp...

Computational Complexity (1st ed.). Addison Wesley. pp. 181–218. ISBN 978-0-201-53082-7. Computational Complexity of Games and Puzzles Tetris is Hard, Even...

(1993), Computational Complexity (1st ed.), Addison Wesley, ISBN 978-0-201-53082-7 Chapter 11: Randomized computation, pp. 241–278. Rabin, Michael O...

(1993). Computational Complexity (1st ed.). Addison Wesley. ISBN 978-0-201-53082-7. Pippenger, Nicholas (1997). Theories of Computability (1st ed.)....

Christos H. (1994), Computational Complexity, Addison–Wesley, ISBN 978-0-201-53082-7. Peleg, David (2000), Distributed Computing: A Locality-Sensitive...

(1994), Computational Complexity (1st ed.), Addison Wesley, ISBN 978-0-201-53082-7 Sipser, Michael (2006), Introduction to the Theory of Computation...

Christos H. (1994), Computational Complexity, Addison-Wesley, p. 405, ISBN 9780201530827 Complexity Zoo: polyL Ferrarotti, Flavio; González, Senén; Schewe, Klaus-Dieter;...

Christos H. (1994). Computational Complexity. Addison-Wesley. p. 236. ISBN 9780201530827. Eiter, Thomas; Gottlob, Georg (2002). "Hypergraph transversal computation...

Christos (1994). Computational Complexity. Boston: Addison-Wesley. ISBN 978-0-201-53082-7. Wikiquote has quotations related to P versus NP problem. Fortnow...

Computational Complexity, Addison-Wesley, pp. chapter 4.2, ISBN 978-0-201-53082-7., Thm. 16.3. Cook, Stephen; Kolokolova, Antonina (2004), "A Second-Order...