Pages that link to "Item:Q5402560"

The following pages link to The complexity of satisfiability problems (Q5402560):

Displaying 50 items.

• Data exchange: semantics and query answering (Q555772) (← links)
• Combinatorial sharpness criterion and phase transition classification for random CSPs (Q598196) (← links)
• From monomials to words to graphs. (Q598451) (← links)
• \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• The computational complexity of avoiding spurious states in state space abstraction (Q622104) (← links)
• Equilibria of graphical games with symmetries (Q627165) (← links)
• The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
• On the complexity of reconfiguration problems (Q631762) (← links)
• Popular matchings with variable item copies (Q631788) (← links)
• The complexity of recursive constraint satisfaction problems (Q636283) (← links)
• Hybrid tractability of valued constraint problems (Q646503) (← links)
• Approximating integer programs with positive right-hand sides (Q656570) (← links)
• Colorful strips (Q659707) (← links)
• 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
• The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
• A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
• Unit-time scheduling problems with time dependent resources (Q678109) (← links)
• Complexity of the satisfiability problem for multilinear forms over a finite field (Q682219) (← links)
• Tractability conditions for numeric CSPs (Q683751) (← links)
• On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
• Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (Q690466) (← links)
• Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
• Approximation of Boolean functions to Schaefer's classes (Q690760) (← links)
• The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
• Trichotomies in the complexity of minimal inference (Q692908) (← links)
• On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
• The complexity of the list homomorphism problem for graphs (Q693060) (← links)
• Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
• The checkpoint problem (Q714790) (← links)
• The complexity of asynchronous model based testing (Q714798) (← links)
• Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
• On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
• On the most imbalanced orientation of a graph (Q721946) (← links)
• Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
• Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
• Maximizing the minimum voter satisfaction on spanning trees (Q732928) (← links)
• Regular expression order-sorted unification and matching (Q741252) (← links)
• Algorithms for the maximum satisfiability problem (Q753502) (← links)
• Computational complexity of norm-maximization (Q757258) (← links)
• On linear k-arboricity (Q761470) (← links)
• Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
• Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
• The complexity of relating quantum channels to master equations (Q766099) (← links)
• The stable marriage problem with ties and restricted edges (Q783028) (← links)
• On weak positive predicates over a finite set (Q783121) (← links)
• Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
• A simplified NP-complete satisfiability problem (Q790612) (← links)
• Signsolvability revisited (Q795898) (← links)
• The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)