The following pages link to (Q4138187):
Displaying 50 items.
- On universal learning algorithms (Q287154) (← links)
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- A linear-time transformation of linear inequalities into conjunctive normal form (Q293409) (← links)
- Complexity versus stability for classes of propositional formulas (Q293437) (← links)
- Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (Q293458) (← links)
- Constrained multi-object auctions and \(b\)-matching (Q294790) (← links)
- Solving parity games by a reduction to SAT (Q414902) (← links)
- Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
- Ordered vertex removal and subgraph problems (Q582090) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- A weight-balanced branching rule for SAT (Q597527) (← links)
- A syntax-based approach to measuring the degree of inconsistency for belief bases (Q648367) (← links)
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- Combination techniques and decision problems for disunification (Q673624) (← links)
- Automorphisms in the PTIME-Turing degrees of recursive sets (Q676317) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- On the theory of the PTIME degrees of the recursive sets (Q751819) (← links)
- A simplified NP-complete satisfiability problem (Q790612) (← links)
- A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets (Q790804) (← links)
- Edge-contraction problems (Q794164) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Probabilistic approach to the satisfiability problem (Q808705) (← links)
- Completeness in approximation classes (Q811119) (← links)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← links)
- The Helly property on subfamilies of limited size (Q834991) (← links)
- A computational model for RNA multiple structural alignment (Q859849) (← links)
- Quantum cooperative search algorithm for 3-sat (Q859988) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- A note on a theorem of Blum, Shub, and Smale (Q909656) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Satisfiability of algebraic circuits over sets of natural numbers (Q987688) (← links)
- Properties of uniformly hard languages (Q1041777) (← links)
- On self-reducibility and weak P-selectivity (Q1054475) (← links)
- Consistency in nondeterministic storage (Q1060847) (← links)
- Games against nature (Q1069296) (← links)
- Solving satisfiability in less than \(2^ n\) steps (Q1082830) (← links)
- Complete divisibility problems for slowly utilized oracles (Q1083192) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- Scheduling with semaphore constraints (Q1096534) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- A note on complete problems for complexity classes (Q1097029) (← links)
- Some results and experiments in programming techniques for propositional logic (Q1100931) (← links)
- A parallel approach for theorem proving in propositional logic (Q1102766) (← links)
- Checking local optimality in constrained quadratic programming is NP- hard (Q1102861) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
