Comparison of polynomial-time reducibilities
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Complete register allocation problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Classification of computable functions by primitive recursive classes
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Polynomial complete scheduling problems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY
RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY
Planar 3-colorability is polynomial complete
ACM SIGACT News
Minimal degrees for polynomial reducibilities
Journal of the ACM (JACM)
On the theory of average case complexity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Relativized Questions Involving Probabilistic Algorithms
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Undecidability and incompleteness results in automata theory
A half-century of automata theory
SIGACT news complexity theory column 34
ACM SIGACT News
Computational Complexity for Physicists
Computing in Science and Engineering
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On the Structure of the Simulation Order of Proof Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Model Checking and Inference in Minimal Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
(2+ f(n))-SAT and Its Properties
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Theoretical Computer Science - Australasian computer science
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Separating NP-Completeness Notions Under Strong Hypotheses
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Undecidability Results For Low Complexity Degree Structures
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Polynomial reducibilities and upward diagonalizations
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
NP-complete decision problems for quadratic polynomials
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Relativized questions involving probabilistic algorithms
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Sparse sets in NP-P: Exptime versus nexptime
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Some structural properties of polynomial reducibilities and sets in NP
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
The complexity of minimal satisfiability problems
Information and Computation
Existential second-order logic over graphs: Charting the tractability frontier
Journal of the ACM (JACM)
(2 +f(n))-SAT and its properties
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
The impact of complexity theory on algorithms for sparse polynomials
ACM SIGSAM Bulletin
Properties of uniformly hard languages
Information Processing Letters
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
Resource bounded immunity and simplicity
Theoretical Computer Science
Theoretical Computer Science
Canonical disjoint NP-pairs of propositional proof systems
Theoretical Computer Science
First-order query rewriting for inconsistent databases
Journal of Computer and System Sciences
On counting homomorphisms to directed acyclic graphs
Journal of the ACM (JACM)
An explicit solution to Post's Problem over the reals
Journal of Complexity
Forbidden lifts (NP and CSP for combinatorialists)
European Journal of Combinatorics
What makes propositional abduction tractable
Artificial Intelligence
Partially Ordered Connectives and Monadic Monotone Strict NP
Journal of Logic, Language and Information
Non-dichotomies in Constraint Satisfaction Complexity
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Partial Polymorphisms and Constraint Satisfaction Problems
Complexity of Constraints
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
The complexity of weighted Boolean #CSP with mixed signs
Theoretical Computer Science
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
On problems without polynomial kernels
Journal of Computer and System Sciences
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Propositional abduction is almost always hard
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Properties of uniformly hard languages
Information Processing Letters
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
Satisfiability with exponential families
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
The structure of detour degrees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Proceedings of the forty-second ACM symposium on Theory of computing
Constraint satisfaction problems and global cardinality constraints
Communications of the ACM
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Parameterized complexity and kernelizability of max ones and exact ones problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the containment of forbidden patterns problems
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
On the approximation complexity hierarchy
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A Complexity Dichotomy for Partition Functions with Mixed Signs
SIAM Journal on Computing
Finding reductions automatically
Fields of logic and computation
Note: The Ck-extended graft construction
Discrete Applied Mathematics
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The Complexity of Positive First-Order Logic without Equality
ACM Transactions on Computational Logic (TOCL)
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
On Ladner's result for a class of real machines with restricted use of constants
Information and Computation
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
A dichotomy in the complexity of consistent query answering for queries with two atoms
Information Processing Letters
First-order query rewriting for inconsistent databases
ICDT'05 Proceedings of the 10th international conference on Database Theory
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Generalised integer programming based on logically defined relations
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Canonical disjoint NP-Pairs of propositional proof systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
An explicit solution to post's problem over the reals
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Survey of disjoint NP-pairs and relations to propositional proof systems
Theoretical Computer Science
On teaching the basics of complexity theory
Theoretical Computer Science
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: A survey on the structure of approximation classes
Computer Science Review
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Survey: The consequences of eliminating NP solutions
Computer Science Review
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Theoretical Computer Science
Experimental descriptive complexity
Logic and Program Semantics
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Multi-valued functions in computability theory
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Information and Computation
NP by means of lifts and shadows
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Lewis Dichotomies in Many-Valued Logics
Studia Logica
Charting the tractability frontier of certain conjunctive query answering
Proceedings of the 32nd symposium on Principles of database systems
A dichotomy in the complexity of counting database repairs
Journal of Computer and System Sciences
A complete dichotomy rises from the capture of vanishing signatures: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.03 |