6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
7 - The Bright Side of Hardness
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 241-283
-
- Chapter
- Export citation
5 - Space Complexity
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 143-183
-
- Chapter
- Export citation
![](https://assets.cambridge.org/97805218/84730/cover/9780521884730.jpg)
Computational Complexity
- A Conceptual Perspective
-
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008
Index
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 601-606
-
- Chapter
- Export citation
10 - Relaxing the Requirements
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 416-460
-
- Chapter
- Export citation
Appendix A - Glossary of Complexity Classes
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 463-468
-
- Chapter
- Export citation
Epilogue
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 461-462
-
- Chapter
- Export citation
Appendix E - Explicit Constructions
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 545-565
-
- Chapter
- Export citation
1 - Introduction and Preliminaries
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 1-43
-
- Chapter
- Export citation
6 - Randomness and Counting
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 184-240
-
- Chapter
- Export citation
Appendix C - On the Foundations of Modern Cryptography
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 482-522
-
- Chapter
- Export citation
3 - Variations on P and NP
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 108-126
-
- Chapter
- Export citation
9 - Probabilistic Proof Systems
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 349-415
-
- Chapter
- Export citation
Acknowledgments
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp xxiii-xxiv
-
- Chapter
- Export citation
Preface
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp xv-xvi
-
- Chapter
- Export citation
Appendix B - On the Quest for Lower Bounds
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 469-481
-
- Chapter
- Export citation
Contents
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp vii-xii
-
- Chapter
- Export citation
2 - P, NP, and NP-Completeness
-
- Book:
- Computational Complexity
- Published online:
- 05 June 2012
- Print publication:
- 28 April 2008, pp 44-107
-
- Chapter
- Export citation
Least Periods of Factors of Infinite Words
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 1 / January 2009
- Published online by Cambridge University Press:
- 12 March 2008, pp. 165-178
- Print publication:
- January 2009
-
- Article
- Export citation
Palindromic complexity of infinite words associated with non-simple Parry numbers
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 1 / January 2009
- Published online by Cambridge University Press:
- 12 March 2008, pp. 145-163
- Print publication:
- January 2009
-
- Article
- Export citation