Pages that link to "Item:Q3331209"
From MaRDI portal
The following pages link to On the unique satisfiability problem (Q3331209):
Displayed 50 items.
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Language equations with complementation: decision problems (Q880178) (← links)
- Autoreducibility, mitoticity, and immunity (Q881593) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- Complexity of unique list colorability (Q935144) (← links)
- The complexity of unions of disjoint sets (Q955349) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- Uniquely solvable quadratic Boolean equations (Q1070255) (← links)
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- Polynomial terse sets (Q1104077) (← links)
- The complexity of facets resolved (Q1109565) (← links)
- Complexity classes without machines: on complete languages for UP (Q1109566) (← links)
- A hierarchy of propositional Horn formuls (Q1122571) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- A linear time algorithm for unique Horn satisfiability (Q1313762) (← links)
- Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)
- The unique Horn-satisfiability problem and quadratic Boolean equations. (Q1353999) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- On the computational complexity of determining polyatomic structures by X-rays (Q1575953) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- Unique satisfiability of Horn sets can be solved in nearly linear time (Q1894352) (← links)
- Parameterized random complexity (Q1946497) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- Language equations (Q2074222) (← links)
- The complexity of counting edge colorings for simple graphs (Q2232603) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Counting the number of solutions for instances of satisfiability (Q2277848) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- Relativized counting classes: Relations among thresholds, parity, and mods (Q2638771) (← links)
- On the Complexity of Master Problems (Q2946425) (← links)
- Limitations of the upward separation technique (Q3490941) (← links)
- The difference and truth-table hierarchies for NP (Q3783278) (← links)
- Simultaneous strong separations of probabilistic and unambiguous complexity classes (Q3992020) (← links)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- The expressive power of unique total stable model semantics (Q4572012) (← links)
- (Q5092397) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- SELF-SPECIFYING MACHINES (Q5249003) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
- Counting classes: Thresholds, parity, mods, and fewness (Q5905584) (← links)