Undirected connectivity in log-space
Journal of the ACM (JACM)
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Towards a theory for securing time synchronization in wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
The computational status of physics
Natural Computing: an international journal
On the Complexity of Matroid Isomorphism Problems
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On optimal precoding in linear vector Gaussian channels with arbitrary input distribution
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Polynomial-space approximation of no-signaling provers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
Property testing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Another proof that BPP ⊆ PH (and more)
Studies in complexity and cryptography
Studies in complexity and cryptography
Notes on Levin's theory of average-case complexity
Studies in complexity and cryptography
Studies in complexity and cryptography
Short locally testable codes and proofs
Studies in complexity and cryptography
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
Studies in complexity and cryptography
Average case complexity, revisited
Studies in complexity and cryptography
Basic facts about expander graphs
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Studies in complexity and cryptography
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Optimizing mixing in pervasive networks: a graph-theoretic perspective
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
On the degree of univariate polynomials over the integers
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Computation as an unbounded process
Theoretical Computer Science
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Complete problem for perfect zero-knowledge quantum proof
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Complexity Theory for Operators in Analysis
ACM Transactions on Computation Theory (TOCT)
Characterizing pseudoentropy and simplifying pseudorandom generator constructions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computer Science Review
The Complexity of Distributions
SIAM Journal on Computing
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
ACM Transactions on Computation Theory (TOCT)
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Witness encryption and its applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Optimizing mix-zone coverage in pervasive wireless networks
Journal of Computer Security - Research in Computer Security and Privacy: Emerging Trends
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Hi-index | 0.01 |
This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.