Pages that link to "Item:Q5667480"
From MaRDI portal
The following pages link to The complexity of theorem-proving procedures (Q5667480):
Displaying 50 items.
- Generating meta-heuristic optimization code using ADATE (Q604934) (← links)
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- On the Pólya permanent problem over finite fields (Q607375) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Holographic algorithms: from art to science (Q619900) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- A randomized algorithm for 3-SAT (Q626900) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- Efficiently embedding QUBO problems on adiabatic quantum computers (Q670075) (← links)
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- Complexity of the satisfiability problem for multilinear forms over a finite field (Q682219) (← links)
- Variability-based model transformation: formal foundation and application (Q682373) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- The relative complexity of analytic tableaux and SL-resolution (Q687165) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Feasibility problems for recurring tasks on one processor (Q688715) (← links)
- On the contribution of backward jumps to instruction sequence expressiveness (Q692892) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- The complexity of variable minimal formulas (Q708020) (← links)
- Stochastic game logic (Q715046) (← links)
- Tractable stochastic analysis in high dimensions via robust optimization (Q715242) (← links)
- Families of subsets without a given poset in double chains and Boolean lattices (Q722595) (← links)
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
- On the subgraph epimorphism problem (Q741740) (← links)
- Model-based adaptive spatial sampling for occurrence map construction (Q746249) (← links)
- A dual algorithm for the satisfiability problem (Q750165) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Computational experience with an interior point algorithm on the satisfiability problem (Q753688) (← links)
- The complexity of equivalence for commutative rings (Q758209) (← links)
- Most relevant explanation: Computational complexity and approximation methods (Q766267) (← links)
- Fuzzy alternating automata over distributive lattices (Q781276) (← links)
- Solving the 3-COL problem by using tissue P systems without environment and proteins on cells (Q781876) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Signsolvability revisited (Q795898) (← links)
- A parallelization scheme based on work stealing for a class of SAT solvers (Q812442) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- Independent domination in hereditary classes (Q818132) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- Subject-oriented spatial logic (Q821569) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- The enduring scandal of deduction. Is propositional logic really uninformative? (Q833033) (← links)
- A comparative runtime analysis of heuristic algorithms for satisfiability problems (Q835804) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- A collaborative approach for multi-threaded SAT solving (Q839500) (← links)
- SAT-solving in practice, with a tutorial example from supervisory control (Q843991) (← links)
