A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Complexity of decision problems based on finite two-person perfect-information games
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
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
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On Two-Dimensional Via Assignment for Single-Row Routing
IEEE Transactions on Computers
The minimum consistent DFA problem cannot be approximated within and polynomial
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
On Polynomial-Time Testable Combinational Circuits
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns
IEEE Transactions on Parallel and Distributed Systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Closure properties of constraints
Journal of the ACM (JACM)
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The phase transition in random Horn satisfiability and its algorithmic implications
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Conjunctive planning problems with constrained goal interactions
CSC '87 Proceedings of the 15th annual conference on Computer Science
Existential second-order logic over strings
Journal of the ACM (JACM)
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of bicoloring clique hypergraphs of graphs (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Building tractable disjunctive constraints
Journal of the ACM (JACM)
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
3-manifold knot genus is NP-complete
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Information and Computation
On propagation of deletions and annotations through views
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIGACT news complexity theory column 34
ACM SIGACT News
Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
The NP-completeness of (1,r)-subcolorability of cubic graphs
Information Processing Letters
Exploiting structure in quantified formulas
Journal of Algorithms
Relaxations of the Satisfiability Problem Using Semidefinite Programming
Journal of Automated Reasoning
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
On the complexity of bicoloring clique hypergraphs of graphs
Journal of Algorithms
Forbidden subgraph decomposition
Discrete Mathematics
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
Faster exact solutions for some NP-hard problems
Theoretical Computer Science
The phase transition in random horn satisfiability and its algorithmic implications
Random Structures & Algorithms
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Pushing vertices in digraphs without long induced cycles
Discrete Applied Mathematics
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
Linear-time recognition of bipartite graphs plus two edges
Discrete Mathematics
Partitioning graphs into generalized dominating sets
Nordic Journal of Computing
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Satisfiability of Systems of Equations over Finite Monoids
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Constraint Satisfaction Problems and Finite Algebras
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Realizability and Verification of MSC Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Generalized H-Coloring of Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Inapproximability Results on Stable Marriage Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Pattern Matching and Membership for Hierarchical Message Sequence Charts
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Computing Ad-hoc Selective Families
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Learnability of Quantified Formulas
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
New Tractable Classes from Old
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CL '00 Proceedings of the First International Conference on Computational Logic
On the Hardness of Recognizing Bundles in Time Table Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
The Complexity of the Matching-Cut Problem
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph Subcolorings: Complexity and Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Complexity of Pattern Coloring of Cycle Systems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Boolean Formulas are Hard to Learn for most Gate Bases
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
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
Fitting Points on the Real Line and Its Application to RH Mapping
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Dichotomy Theorem for the Generalized Unique Satisfiability Problem
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Partition the vertices of a graph into induced matchings
Discrete Mathematics
The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT
Eighteenth national conference on Artificial intelligence
New tractable constraint classes from old
Exploring artificial intelligence in the new millennium
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
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science
New Tractable Classes From Old
Constraints
SIGACT News complexity theory column 41
ACM SIGACT News
Learnability of quantified formulas
Theoretical Computer Science
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
An efficient algorithm for Horn description
Information Processing Letters
Fitting points on the real line and its application to RH mapping
Journal of Algorithms
The complexity of minimal satisfiability problems
Information and Computation
SIGACT news complexity theory column 43
ACM SIGACT News
Implementing a Test for Tractability
Constraints
Fast approximate probabilistically checkable proofs
Information and Computation
Dichotomies for classes of homomorphism problems involving unary functions
Theoretical Computer Science
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
From monomials to words to graphs
Journal of Combinatorial Theory Series A
Packing Steiner trees with identical terminal sets
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Some Dichotomy Theorems for Neural Learning Problems
The Journal of Machine Learning Research
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
Exact 3-Satisfiability Is Decidable in Time O(20.16254n)
Annals of Mathematics and Artificial Intelligence
On Counting Fixed Point Configurations in Star Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Conjunctive queries over trees
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
The expressive rate of constraints
Annals of Mathematics and Artificial Intelligence
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Information Processing Letters
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
An algorithm for exact satisfiability analysed with the number of clauses as parameter
Information Processing Letters
Conjunctive queries over trees
Journal of the ACM (JACM)
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
The complexity of soft constraint satisfaction
Artificial Intelligence
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
Methods and limitations of security policy reconciliation
ACM Transactions on Information and System Security (TISSEC)
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
New algorithms for exact satisfiability
Theoretical Computer Science
Nonnegative integral subset representations of integer sets
Information Processing Letters
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
Complexity and approximation of the minimum recombinant haplotype configuration problem
Theoretical Computer Science
The dichotomy of conjunctive queries on probabilistic structures
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hardness results on the man-exchange stable marriage problem with short preference lists
Information Processing Letters
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
On counting homomorphisms to directed acyclic graphs
Journal of the ACM (JACM)
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Minimum-weight triangulation is NP-hard
Journal of the ACM (JACM)
On the counting complexity of propositional circumscription
Information Processing Letters
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
What makes propositional abduction tractable
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graphs, polymorphisms and the complexity of homomorphism problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
Partially Ordered Connectives and Monadic Monotone Strict NP
Journal of Logic, Language and Information
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
Computational Complexity
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On Recovering Syntenic Blocks from Comparative Maps
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Quantified Positive Temporal Constraints
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
On the Approximation Resistance of a Random Predicate
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Relatively quantified constraint satisfaction
Constraints
Equilibria of Graphical Games with Symmetries
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Complexity of Constraints
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Partial Polymorphisms and Constraint Satisfaction Problems
Complexity of Constraints
On Some SAT-Variants over Linear Formulas
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the Computational Complexity of Monotone Constraint Satisfaction Problems
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Existentially restricted quantified constraint satisfaction
Information and Computation
Bit-precise reasoning with affine functions
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Discrete Applied Mathematics
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
Data Mining and Knowledge Discovery
Integer programming with 2-variable equations and 1-variable inequalities
Information Processing Letters
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
Complexity of (p,1)-total labelling
Discrete Applied Mathematics
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On the Tractability of Maximal Strip Recovery
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Tricolorable torus knots are NP-complete
Proceedings of the 47th Annual Southeast Regional Conference
Hybrid tractable CSPs which generalize tree structure
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
On Some Aspects of Mixed Horn Formulas
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
Complexity of counting the optimal solutions
Theoretical Computer Science
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
The Complexity of Circumscriptive Inference in Post's Lattice
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New polynomial classes for logic-based abduction
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
Fault tolerant Boolean satisfiability
Journal of Artificial Intelligence Research
Set intersection and consistency in constraint networks
Journal of Artificial Intelligence Research
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Counting complexity of propositional abduction
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Amalgams of constraint satisfaction problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A maximal tractable class of soft constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propositional abduction is almost always hard
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Constraints, consistency and closure
Artificial Intelligence
The complexity of soft constraint satisfaction
Artificial Intelligence
NP-hard and linear variants of hypergraph partitioning
Theoretical Computer Science
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Popular Matchings with Variable Job Capacities
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Decreasing error floor in LDPC codes by parity-check matrix extensions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Model-based Runtime Verification Framework for Self-optimizing Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Information Processing Letters
An algorithm for Exact Satisfiability analysed with the number of clauses as parameter
Information Processing Letters
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
Approximating integer programs with positive right-hand sides
Information Processing Letters
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
Complexity of default logic on generalized conjunctive queries
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Enumerating all solutions for constraint satisfaction problems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
Algorithms for variable-weighted 2-SAT and dual problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On the boolean connectivity problem for horn relations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Boolean approximation revisited
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Information loss in knowledge compilation: A comparison of Boolean envelopes
Artificial Intelligence
Computational complexity of generalized domination: a complete dichotomy for chordal graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The longest haplotype reconstruction problem revisited
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A CNF class generalizing exact linear formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Qualitative spatial reasoning with topological information
Qualitative spatial reasoning with topological information
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic (TOCL)
Proceedings of the forty-second ACM symposium on Theory of computing
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
Unification modulo homomorphic encryption
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Generalized modal satisfiability
Journal of Computer and System Sciences
Counting complexity of propositional abduction
Journal of Computer and System Sciences
Constraint satisfaction problems and global cardinality constraints
Communications of the ACM
The computational complexity of avoiding spurious states in state space abstraction
Artificial Intelligence
k-L(2,1)-labelling for planar graphs is NP-complete for k≥4
Discrete Applied Mathematics
Boolean affine approximation with binary decision diagrams
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
The complexity of closed world reasoning and circumscription
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Algorithms and complexity for reasoning about time
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Inapproximability for planar embedding problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Graph homomorphisms with complex values: a dichotomy theorem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Preprocessing of min ones problems: a dichotomy
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Fréchet distance of surfaces: some simple hard cases
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
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
The lattice structure of sets of surjective hyper-operations
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Approximating linear threshold predicates
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Extensions of the minimum cost homomorphism problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
The complexity of positive first-order logic without equality II: the four-element case
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Resolution for stochastic Boolean satisfiability
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Equilibria of graphical games with symmetries
Theoretical Computer Science
Narrowing down the gap on the complexity of coloring Pk-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A trichotomy theorem for the approximate counting of complex-weighted bounded-degree boolean CSPs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Popular matchings with variable item copies
Theoretical Computer Science
On the complexity of reconfiguration problems
Theoretical Computer Science
Approximate counting for complex-weighted Boolean constraint satisfaction problems
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Partition into triangles on bounded degree graphs
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Conjunctive query containment over trees
Journal of Computer and System Sciences
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
On the Complexity of Selecting Disjunctions in Integer Programming
SIAM Journal on Optimization
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Finding reductions automatically
Fields of logic and computation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Hybrid tractability of valued constraint problems
Artificial Intelligence
The least spanning area of a knot and the optimal bounding chain problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Locally injective homomorphism to the simple weight graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Generalized satisfiability for the description logic ALC
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Progress in complexity of counting problems
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Enumerating all solutions of a boolean CSP by non-decreasing weight
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
The order encoding: from tractable CSP to tractable SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Constraint satisfaction parameterized by solution size
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Characterizing arithmetic circuit classes by constraint satisfaction problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
An algebraic theory of complexity for valued constraints: establishing a Galois connection
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Submodularity on a tree: unifying L-convex and bisubmodular functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Edge-matching problems with rotations
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Coloring graphs without short cycles and long induced paths
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Algorithms for solving Rubik's cubes
ESA'11 Proceedings of the 19th European conference on Algorithms
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
QCSP on partially reflexive forests
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Quantified Equality Constraints
SIAM Journal on Computing
The Recognition of Tolerance and Bounded Tolerance Graphs
SIAM Journal on Computing
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Acyclic orientation of drawings
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
On the computational complexity of the L(2,1)-labeling problem for regular graphs
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Comprehensive verification framework for dependability of self-optimizing systems
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Agglomerative hierarchical clustering with constraints: theoretical and empirical results
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Looking algebraically at tractable quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Equivalence models for quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Search vs. symbolic techniques in satisfiability solving
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
Information Processing Letters
On making directed graphs transitive
Journal of Computer and System Sciences
Universal structures and the logic of forbidden patterns
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the complexity of the balanced vertex ordering problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Unification Modulo Homomorphic Encryption
Journal of Automated Reasoning
Complexity and approximation of the minimum recombination haplotype configuration problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Solving minimum weight exact satisfiability in time O(20.2441n)
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Algorithms for max hamming exact satisfiability
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The complexity of making unique choices: approximating 1-in-k SAT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On some weighted satisfiability and graph problems
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
Counting all solutions of minimum weight exact satisfiability
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The connectivity of boolean satisfiability: computational and structural dichotomies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Systems of equations over finite semigroups and the #CSP dichotomy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Theory and Practice of Logic Programming
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximating Linear Threshold Predicates
ACM Transactions on Computation Theory (TOCT)
Community structure in large complex networks
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
On the hardness of losing weight
ACM Transactions on Algorithms (TALG)
Efficient sampling in relational feature spaces
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Closure properties of weak systems of bounded arithmetic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The hypocoloring problem: complexity and approximability results when the chromatic number is small
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Distance three labelings of trees
Discrete Applied Mathematics
Complexity results for linear XSAT-Problems
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
An empirical study of the component dependency resolution search space
CBSE'10 Proceedings of the 13th international conference on Component-Based Software Engineering
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Influence of tree topology restrictions on the complexity of haplotyping with missing data
Theoretical Computer Science
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Robust satisfiability of constraint satisfaction problems
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
The root location problem for arc-disjoint arborescences
Discrete Applied Mathematics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Theoretical Computer Science
The complexity of asynchronous model based testing
Theoretical Computer Science
Theoretical Computer Science
A Complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling
SIAM Journal on Discrete Mathematics
Meditations on quantified constraint satisfaction
Logic and Program Semantics
Logic and Program Semantics
The worst-case upper bound for exact 3-satisfiability with the number of clauses as the parameter
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
ICN-RE: redundancy elimination for information-centric networking
Proceedings of the second edition of the ICN workshop on Information-centric networking
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
The Multivariate Algorithmic Revolution and Beyond
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science
On the behavior of tile assembly system at high temperatures
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
A dichotomy theorem for homomorphism polynomials
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
UNIFICATION MODULO ACI + 1 + 0
Fundamenta Informaticae
Discrete Applied Mathematics
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Information and Computation
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
Theoretical Computer Science
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Universal algebra and hardness results for constraint satisfaction problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Containment, equivalence and coreness from CSP to QCSP and beyond
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the PLS-complexity of maximum constraint assignment
Theoretical Computer Science
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
Sensitivity of Boolean formulas
European Journal of Combinatorics
Journal of Artificial Intelligence Research
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
On the complexity of recognizing S-composite and S-prime graphs
Discrete Applied Mathematics
A white-box policy analysis and its efficient implementation
Proceedings of the 18th ACM symposium on Access control models and technologies
Second order partial derivatives for NK-landscapes
Proceedings of the 15th annual conference on Genetic and evolutionary computation
A complete dichotomy rises from the capture of vanishing signatures: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
Journal of Combinatorial Theory Series B
An algebraic characterization of testable boolean CSPs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A note on the complexity of matching patterns with variables
Information Processing Letters
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
On the isomorphism problem for decision trees and decision lists
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
The complexity of complex weighted Boolean #CSP
Journal of Computer and System Sciences
Generalized satisfiability for the description logic ALC
Theoretical Computer Science
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
Revenue maximization via hiding item attributes
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Do hard SAT-related reasoning tasks become easier in the Krom fragment?
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Knowledge compilation for model counting: affine decision trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Transition constraints: a study on the computational complexity of qualitative change
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
Solving a real-life, large-scale energy management problem
Journal of Scheduling
Minimal and almost minimal reaction systems
Natural Computing: an international journal
Belief revision within fragments of propositional logic
Journal of Computer and System Sciences
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Theoretical Computer Science
List coloring in the absence of two subgraphs
Discrete Applied Mathematics
Is the Protein Model Assignment problem under linked branch lengths NP-hard?
Theoretical Computer Science
XSAT and NAE-SAT of linear CNF classes
Discrete Applied Mathematics
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics
Edge-intersection graphs of grid paths: The bend-number
Discrete Applied Mathematics
Journal of Combinatorial Optimization
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
The vertex leafage of chordal graphs
Discrete Applied Mathematics
| Hi-index | 0.06 |
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied. I t is known that, when restricted to formulas having only two literals per clause, this problem has an efficient (polynomial-time) solution. But the same problem on formulas having three literals per clause is NP-complete, and hence probably does not have any efficient solution. In this paper, we consider an infinite class of satisfiability problems which contains these two particular problems as special cases, and show that every member of this class is either polynomial-time decidable or NP-complete. The infinite collection of new NP-complete problems so obtained may prove very useful in finding other new NP-complete problems. The classification of the polynomial-time decidable cases yields new problems that are complete in polynomial time and in nondeterministic log space. We also consider an analogous class of problems, involving quantified formulas, which has the property that every member is either polynomial time decidable or complete in polynomial space.