Pages that link to "Item:Q1178690"

The following pages link to Bounded queries to SAT and the Boolean hierarchy (Q1178690):

Displaying 37 items.

• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
• Mind change speed-up for learning languages from positive data (Q388110) (← links)
• The strong exponential hierarchy collapses (Q584250) (← links)
• On quasilinear-time complexity theory (Q672330) (← links)
• Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
• On adaptive versus nonadaptive bounded query machines (Q808242) (← links)
• A note on enumerative counting (Q809598) (← links)
• Bi-immunity results for cheatable sets (Q920981) (← links)
• Exact complexity of exact-four-colorability (Q1014384) (← links)
• Bounded query classes and the difference hierarchy (Q1114678) (← links)
• Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
• Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
• The landscape of communication complexity classes (Q1653337) (← links)
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
• Commutative queries (Q1854422) (← links)
• Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
• Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
• Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
• Amplification with one \textsf{NP} oracle query (Q2125078) (← links)
• A note on bi-immunity and \(p\)-closeness of \(p\)-cheatable sets in \(P\)/poly (Q2366689) (← links)
• A note on parallel queries and the symmetric-difference hierarchy. (Q2583533) (← links)
• A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (Q3540180) (← links)
• Query Order (Q4210168) (← links)
• Bounded queries to arbitrary sets (Q4717045) (← links)
• Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (Q4717047) (← links)
• On computing Boolean connectives of characteristic functions (Q4835862) (← links)
• (Q4972740) (← links)
• The power of frequency computation (Q5055904) (← links)
• The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
• Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria (Q5055938) (← links)
• (Q5091257) (← links)
• Characterizations of some complexity classes between Θ2p and Δ2p (Q5096790) (← links)
• Promise problems and access to unambiguous computation (Q5096827) (← links)
• (Q5111621) (← links)
• A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273) (← links)
• Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> (Q5444705) (← links)
• The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)