NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k,r-UNLSAT ≥ k)
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Towards Rule-Based Minimization of RDF Graphs under Constraints
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
The detectability lemma and quantum gap amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Privacy-Preserving Data Publishing
Foundations and Trends in Databases
Communication complexity of stochastic games
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Short PCPPs verifiable in polylogarithmic time with O(1) queries
Annals of Mathematics and Artificial Intelligence
Note: Smallest formulas for the parity of 2 k variables are essentially unique
Theoretical Computer Science
Assisting the autistic with real-time facial expression recognition
IIT'09 Proceedings of the 6th international conference on Innovations in information technology
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Complexity of judgment aggregation: safety of the agenda
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Inapproximability for VCG-based combinatorial auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Avoiding simplicity is complex
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Quantum computation with devices whose contents are never read
UC'10 Proceedings of the 9th international conference on Unconventional computation
The multivariate resultant is NP-hard in any characteristic
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
From feasible proofs to feasible computations
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Natural Computing: an international journal
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Computational complexity and information asymmetry in financial products
Communications of the ACM
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
Complexity classes of equivalence problems revisited
Information and Computation
Prediction in financial markets: The case for small disjuncts
ACM Transactions on Intelligent Systems and Technology (TIST)
Repeated matching pennies with limited randomness
Proceedings of the 12th ACM conference on Electronic commerce
Economies with non-convex production and complexity equilibria
Proceedings of the 12th ACM conference on Electronic commerce
Almost settling the hardness of noncommutative determinant
Proceedings of the forty-third annual ACM symposium on Theory of computing
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
How strong is Nisan's pseudo-random generator?
Information Processing Letters
Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The geometry of quantum computation
Quantum Information & Computation
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Stable partitions in additively separable hedonic games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Complexity of coalition structure generation
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Counting the orderings for multisets in consecutive ones property and PQ-trees
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Succinct algebraic branching programs characterizing non-uniform complexity classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Immunity and pseudorandomness of context-free languages
Theoretical Computer Science
Verifying computations with streaming interactive proofs
Proceedings of the VLDB Endowment
Journal of the ACM (JACM)
SIAM Journal on Computing
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Pseudorandomness and derandomization
XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
Note: Absoluteness of subword inequality is undecidable
Theoretical Computer Science
On regular realizability problems
Problems of Information Transmission
The power of nondeterminism in self-assembly
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bounding the randomized decision tree complexity of read-once Boolean functions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Quantum computation with write-only memory
Natural Computing: an international journal
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences
Comparison of scalable ACC and MC-CDMA for practical video fingerprinting scheme
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
The GCT program toward the P vs. NP problem
Communications of the ACM
Semidefinite programming and approximation algorithms: a survey
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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
Towards certain fixes with editing rules and master data
The VLDB Journal — The International Journal on Very Large Data Bases
On derandomization and average-case complexity of monotone functions
Theoretical Computer Science
On the complexity of temporal controllabilities for workflow schemata
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Cheap, easy, and massively effective viral marketing in social networks: truth or fiction?
Proceedings of the 23rd ACM conference on Hypertext and social media
A survey of context data distribution for mobile ubiquitous systems
ACM Computing Surveys (CSUR)
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Computing bits of algebraic numbers
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Verifiable computation with massively parallel interactive proofs
HotCloud'12 Proceedings of the 4th USENIX conference on Hot Topics in Cloud Ccomputing
Communication complexity of approximating voting rules
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
ACM Transactions on Computation Theory (TOCT)
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
On the limits of sparsification
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Exponential lower bounds and separation for query rewriting
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A higher-order characterization of probabilistic polynomial time
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
Conflict-Free graph orientations with parity constraints
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Curiouser and curiouser: the link between incompressibility and complexity
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Making solomonoff induction effective: or: you can learn what you can bound
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Timed Sets, Functional Complexity, and Computability
Electronic Notes in Theoretical Computer Science (ENTCS)
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Information and Computation
The walls have ears: optimize sharing for visibility and privacy in online social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
The hardness of counting full words compatible with partial words
Journal of Computer and System Sciences
Instance compression for the polynomial hierarchy and beyond
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Streaming computations with a loquacious prover
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Properties and applications of boolean function composition
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
NSS'12 Proceedings of the 6th international conference on Network and System Security
On the complexity of the multivariate resultant
Journal of Complexity
Complexity of judgment aggregation
Journal of Artificial Intelligence Research
Proof Systems for Planning Under Cautious Semantics
Minds and Machines
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Resolving the conflict between generality and plausibility in verified computation
Proceedings of the 8th ACM European Conference on Computer Systems
QMA variants with polynomially many provers
Quantum Information & Computation
Natural proofs versus derandomization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Lee-Yang theorems and the complexity of computing averages
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Guest column: the quantum PCP conjecture
ACM SIGACT News
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Parameterized verification of asynchronous shared-memory systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Review of universal semantic communication by B. Juba
ACM SIGACT News
Gems in decision tree complexity revisited
ACM SIGACT News
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Ontology-based data access with databases: a short course
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
SEC'13 Proceedings of the 22nd USENIX conference on Security
Optimizing the "one big switch" abstraction in software-defined networks
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
ASC: automatically scalable computation
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
On protection in federated social computing systems
Proceedings of the 4th ACM conference on Data and application security and privacy
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry: Theory and Applications
Monomials, multilinearity and identity testing in simple read-restricted circuits
Theoretical Computer Science
Tradeoff lower lounds for stack machines
Computational Complexity
Computational Complexity
On expressive power of regular realizability problems
Problems of Information Transmission
Journal of Logic, Language and Information
On the Behaviours Produced by Instruction Sequences under Execution
Fundamenta Informaticae
Decision-theoretic troubleshooting: Hardness of approximation
International Journal of Approximate Reasoning
| Hi-index | 0.04 |
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set.