Pages that link to "Item:Q1173957"

The following pages link to On truth-table reducibility to SAT (Q1173957):

Displaying 30 items.

• On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
• On quasilinear-time complexity theory (Q672330) (← links)
• On the complexity of entailment in existential conjunctive first-order logic with atomic negation (Q714500) (← links)
• Planar and grid graph reachability problems (Q733742) (← links)
• Complexity results for explanations in the structural-model approach (Q814579) (← links)
• Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
• Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
• On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
• The closure of monadic NP (Q1577017) (← links)
• Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
• Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
• On the complexity of data disjunctions. (Q1853503) (← links)
• Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
• Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
• On the complexity of the clone membership problem (Q2048213) (← links)
• Isomorphic implication (Q2272203) (← links)
• Complexity-theoretic aspects of expanding cellular automata (Q2278565) (← links)
• On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
• Circuit principles and weak pigeonhole variants (Q2383589) (← links)
• A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
• The complexity of equivalence and isomorphism of systems of equations over finite groups (Q2575758) (← links)
• (Q2941639) (← links)
• Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
• Boolean Game with Prioritized Norms (Q3457717) (← links)
• Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (Q4717047) (← links)
• The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
• The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
• Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> (Q5444705) (← links)
• Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)
• Complexity-theoretic aspects of expanding cellular automata (Q6195134) (← links)