Book contents
- Frontmatter
- Contents
- List of Figures
- Preface
- Organization and Chapter Summaries
- Acknowledgments
- 1 Introduction and Preliminaries
- 2 P, NP, and NP-Completeness
- 3 Variations on P and NP
- 4 More Resources, More Power?
- 5 Space Complexity
- 6 Randomness and Counting
- 7 The Bright Side of Hardness
- 8 Pseudorandom Generators
- 9 Probabilistic Proof Systems
- 10 Relaxing the Requirements
- Epilogue
- Appendix A Glossary of Complexity Classes
- Appendix B On the Quest for Lower Bounds
- Appendix C On the Foundations of Modern Cryptography
- Appendix D Probabilistic Preliminaries and Advanced Topics in Randomization
- Appendix E Explicit Constructions
- Appendix F Some Omitted Proofs
- Appendix G Some Computational Problems
- Bibliography
- Index
Appendix G - Some Computational Problems
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- List of Figures
- Preface
- Organization and Chapter Summaries
- Acknowledgments
- 1 Introduction and Preliminaries
- 2 P, NP, and NP-Completeness
- 3 Variations on P and NP
- 4 More Resources, More Power?
- 5 Space Complexity
- 6 Randomness and Counting
- 7 The Bright Side of Hardness
- 8 Pseudorandom Generators
- 9 Probabilistic Proof Systems
- 10 Relaxing the Requirements
- Epilogue
- Appendix A Glossary of Complexity Classes
- Appendix B On the Quest for Lower Bounds
- Appendix C On the Foundations of Modern Cryptography
- Appendix D Probabilistic Preliminaries and Advanced Topics in Randomization
- Appendix E Explicit Constructions
- Appendix F Some Omitted Proofs
- Appendix G Some Computational Problems
- Bibliography
- Index
Summary
Although we view specific (natural) computational problems as secondary to (natural) complexity classes, we do use the former for clarification and illustration of the latter. This appendix provides definitions of such computational problems, grouped according to the type of objects to which they refer (e.g., graphs, Boolean formula, etc.).
We start by addressing the central issue of the representation of the various objects that are referred to in the aforementioned computational problems. The general principle is that elements of all sets are “compactly” represented as binary strings (without much redundancy). For example, the elements of a finite set S (e.g., the set of vertices in a graph or the set of variables appearing in a Boolean formula) will be represented as binary strings of length log2 |S|.
Graphs
Graph theory has long become recognized as one of the more useful mathematical subjects for the computer science student to master. The approach which is natural in computer science is the algorithmic one; our interest is not so much in existence proofs or enumeration techniques, as it is in finding efficient algorithms for solving relevant problems, or alternatively showing evidence that no such algorithms exist. Although algorithmic graph theory was started by Euler, if not earlier, its development in the last ten years has been dramatic and revolutionary.
Shimon Even, Graph Algorithms- Type
- Chapter
- Information
- Computational ComplexityA Conceptual Perspective, pp. 583 - 588Publisher: Cambridge University PressPrint publication year: 2008