Pages that link to "Item:Q3002779"

The following pages link to On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy (Q3002779):

Displaying 9 items.

• More on BPP and the polynomial-time hierarchy (Q1351599) (← links)
• A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
• A PCP theorem for interactive proofs and applications (Q2170038) (← links)
• Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy (Q2182311) (← links)
• Polynomial threshold reoptimization of generalized satisfiability problems with bounded arity predicates (Q2850118) (← links)
• A PCP Characterization of AM (Q3012834) (← links)
• (Q4501567) (← links)
• The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
• (Q5365140) (← links)