Pages that link to "Item:Q5667480"
From MaRDI portal
The following pages link to The complexity of theorem-proving procedures (Q5667480):
Displaying 50 items.
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Maintenance routing for train units: the interchange model (Q856690) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
- Spectral classes of regular, random, and empirical graphs (Q891525) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- Two-machine interval shop scheduling with time lags (Q892834) (← links)
- Stream-based inconsistency measurement (Q895515) (← links)
- The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
- Non existence of some mixed Moore graphs of diameter 2 using SAT (Q898115) (← links)
- Automatic construction of optimal static sequential portfolios for AI planning and beyond (Q898741) (← links)
- Towards a logical belief function theory (Q901078) (← links)
- On the complexity of the constrained input selection problem for structural linear systems (Q901120) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- The number of depth-first searches of an ordered set (Q909681) (← links)
- Complexity-theoretic algebra. II: Boolean algebras (Q915723) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- On the complexity of ranking (Q920620) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Modelling and simulation of communications network planning (Q921954) (← links)
- An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) (Q924126) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization (Q955309) (← links)
- Decision-making coordination and efficient reasoning techniques for feature-based configuration (Q967553) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- Complexity classes for self-assembling flexible tiles (Q1004079) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- Strong nondeterministic polynomial-time reducibilities (Q1055405) (← links)
- On some natural complete operators (Q1064780) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- An easily testable optimal-time VLSI-multiplier (Q1082330) (← links)
- Heuristic evaluation techniques for bin packing approximation algorithms (Q1083199) (← links)
- A comment on \('''NP=P?'\) and restricted partitions'' (Q1083850) (← links)
- NP-completeness results concerning greedy and super greedy linear extensions (Q1087567) (← links)
