The following pages link to (Q4138187):
Displaying 50 items.
- A satisfiability tester for non-clausal propositional calculus (Q1111774) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Optimal product design using conjoint analysis: Computational complexity and algorithms (Q1115344) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) (Q1118407) (← links)
- Stratification and knowledge base management (Q1122994) (← links)
- Positive relativizations of the \(P=?\) NP problem (Q1124342) (← links)
- Tautology testing with a generalized matrix reduction method (Q1132862) (← links)
- ``A posteriori'' evaluation of bin packing approximation algorithms (Q1139943) (← links)
- The node-deletion problem for hereditary properties is NP-complete (Q1140988) (← links)
- On finding minimal length superstrings (Q1140992) (← links)
- Structure preserving reductions among convex optimization problems (Q1143173) (← links)
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms (Q1143807) (← links)
- Lower bounds on the size of sweeping automata (Q1145513) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (Q1146685) (← links)
- Automatic model construction (Q1149943) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Complexity results for classes of quantificational formulas (Q1157324) (← links)
- The maximum value problem and NP real numbers (Q1161742) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- Local search and the local structure of NP-complete problems (Q1200797) (← links)
- Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
- Structure identification in relational data (Q1204870) (← links)
- The multicovering problem (Q1205691) (← links)
- The interconnection problem (Q1208922) (← links)
- Approximation algorithms for combinatorial problems (Q1213733) (← links)
- A versatile system for computer-controlled assembly (Q1216189) (← links)
- An observation on time-storage trade off (Q1217591) (← links)
- NP-complete scheduling problems (Q1220386) (← links)
- Space-bounded reducibility among combinatorial problems (Q1221749) (← links)
- A comparison of polynomial time reducibilities (Q1223166) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- A characterization of the power of vector machines (Q1232182) (← links)
- Riemann's hypothesis and tests for primality (Q1235011) (← links)
- NP-complete decision problems for binary quadratics (Q1243130) (← links)
- Nondeterminism and Boolean operations in pda's (Q1245576) (← links)
- An algorithm for the quadratic assignment problem using Benders' decomposition (Q1247369) (← links)
- On the complexity of some two-person perfect-information games (Q1248466) (← links)
- On splitting recursive sets (Q1251652) (← links)
- Lower bounds on the worst-case complexity of some oracle algorithms (Q1251896) (← links)
- Candidate keys for relations (Q1253096) (← links)
- Graph isomorphism, general remarks (Q1255944) (← links)
