Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
All superlinear inverse schemes are coNP-hard
Theoretical Computer Science - Mathematical foundations of computer science 2004
Languages to diagonalize against advice classes
Computational Complexity
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
The Complexity of Tensor Circuit Evaluation
Computational Complexity
The boolean hierarchy of NP-partitions
Information and Computation
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
Design of a Passport Anti-forgery System Based on Digital Signature Schemes
PAISI '09 Proceedings of the Pacific Asia Workshop on Intelligence and Security Informatics
Structural properties of oracle classes
Information Processing Letters
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Boolean NP-partitions and projective closure
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Other complexity classes and measures
Algorithms and theory of computation handbook
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
P-Selectivity, immunity, and the power of one bit
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Survey: The consequences of eliminating NP solutions
Computer Science Review
Hi-index | 0.01 |
The Complexity Theory Companion is an accesible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory. The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to move clearly highlight the role of algorithmic techniques in complexity theory, the book is --- unlike other texts on complexity --- organized by technique rather than by topic. each chapter of this book focuses on one technique: what it is, and what results and applications it yields. This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions.