Pages that link to "Item:Q1917076"

The following pages link to Complexity of generalized satisfiability counting problems (Q1917076):

Displaying 50 items.

• The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
• Complexity versus stability for classes of propositional formulas (Q293437) (← links)
• Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048) (← links)
• The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
• The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← links)
• A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
• Disjunctive closures for knowledge compilation (Q460617) (← links)
• A computational proof of complexity of some restricted counting problems (Q534558) (← links)
• On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• On the complexity of generalized chromatic polynomials (Q679542) (← 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)
• The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
• Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
• Regular expression order-sorted unification and matching (Q741252) (← links)
• The complexity of approximating conservative counting CSPs (Q743130) (← links)
• Complexity of counting the optimal solutions (Q837174) (← links)
• The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• On complexity of problem of satisfiability for systems of countable-valued functional equations (Q905075) (← links)
• Time-space tradeoffs for counting NP solutions modulo integers (Q937201) (← links)
• A dichotomy theorem for maximum generalized satisfiability problems. (Q960525) (← links)
• An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
• Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
• Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
• Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
• On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
• Fine-grained dichotomies for the Tutte plane and Boolean \#CSP (Q1725642) (← links)
• The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
• Enumerative counting is hard (Q1822963) (← links)
• The complexity of minimal satisfiability problems (Q1887137) (← links)
• Holographic algorithms by Fibonacci gates (Q1931762) (← links)
• The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
• The complexity of problems for quantified constraints (Q1959381) (← links)
• Satisfiability threshold for random XOR-CNF formulas (Q1961446) (← links)
• Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
• Classical simulation of quantum circuits by half Gauss sums (Q2113488) (← links)
• Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255) (← links)
• Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS (Q2216112) (← links)
• Computational complexity of three-dimensional discrete tomography with missing data (Q2231602) (← links)
• Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems (Q2254494) (← links)
• Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
• Algorithms for propositional model counting (Q2266937) (← links)
• Isomorphic implication (Q2272203) (← links)
• On the complexity of inconsistency measurement (Q2321337) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• Computational complexity of counting problems on 3-regular planar graphs (Q2382289) (← links)