Pages that link to "Item:Q4389761"

The following pages link to On generating all solutions of generalized satisfiability problems (Q4389761):

Displaying 34 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Generating all maximal models of a Boolean expression (Q294760) (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
• An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
• Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
• On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
• Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
• The complexity of minimal satisfiability problems (Q1887137) (← links)
• On rainbow-free colourings of uniform hypergraphs (Q1981770) (← links)
• Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
• Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
• Generating clause sequences of a CNF formula (Q2219060) (← links)
• Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
• Incremental delay enumeration: space and time (Q2274091) (← links)
• A complexity theory for hard enumeration problems (Q2274092) (← links)
• Structural tractability of enumerating CSP solutions (Q2342585) (← links)
• Paradigms for parameterized enumeration (Q2398214) (← links)
• Compactly generating all satisfying truth assignments of a Horn formula (Q2786908) (← links)
• Parameterized Enumeration for Modification Problems (Q2799203) (← links)
• Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
• Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)
• Generating Diverse Solutions in SAT (Q3007690) (← links)
• On the generator problem (Q3824297) (← links)
• (Q3972530) (← links)
• (Q5090503) (← links)
• The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
• (Q5131261) (← links)
• A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
• Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)
• The Weight in Enumeration (Q5738998) (← links)
• Generalized satisfiability problems via operator assignments (Q5919560) (← links)
• Modular SAT-based techniques for reasoning tasks in team semantics (Q6615313) (← links)