Pages that link to "Item:Q1193633"

The following pages link to Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633):

Displaying 26 items.

• The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
• Dependence logic with a majority quantifier (Q302214) (← links)
• Complexity of counting the optimal solutions (Q837174) (← links)
• On the autoreducibility of functions (Q970103) (← links)
• Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
• Relating polynomial time to constant depth (Q1274992) (← links)
• Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
• Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
• The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
• The complexity of problems for quantified constraints (Q1959381) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
• Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence (Q2321260) (← links)
• On the complexity of inconsistency measurement (Q2321337) (← links)
• The effect of combination functions on the complexity of relational Bayesian networks (Q2409113) (← links)
• On the connection between interval size functions and path counting (Q2410681) (← links)
• Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
• On the Complexity of Probabilistic Abstract Argumentation Frameworks (Q2946762) (← links)
• Complexity of Counting the Optimal Solutions (Q3511323) (← links)
• On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
• (Q5095623) (← links)
• SELF-SPECIFYING MACHINES (Q5249003) (← links)
• On the Complexity of Computing Generators of Closed Sets (Q5445331) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
• On measuring inconsistency in definite and indefinite databases with denial constraints (Q6161468) (← links)