scientific article; zbMATH DE number 3566230

Cited in

(only showing first 100 items - show all)

Deterministic job-shop scheduling: Past, present and future
The multicovering problem
The complexity of the word problems for commutative semigroups and polynomial ideals
Consistency in nondeterministic storage
Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
A lower bound for tree resolution
Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic
A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets
A parallel approach for theorem proving in propositional logic
A computationally intractable problem on simplicial complexes
The interconnection problem
A computational model for RNA multiple structural alignment
Complexity of tile rotation problems
A characterization of the power of vector machines
On the theory of average case complexity
Parallel beta reduction is not elementary recursive
Probabilistic approach to the satisfiability problem
The maximum value problem and NP real numbers
A versatile system for computer-controlled assembly
Space-bounded reducibility among combinatorial problems
Complexity of spanning tree problems: Part I
Heuristics and their design: A survey
Graph isomorphism, general remarks
New local search approximation techniques for maximum generalized satisfiability problems
On splitting recursive sets
Structure identification in relational data
``A posteriori evaluation of bin packing approximation algorithms
Complete divisibility problems for slowly utilized oracles
The principle of optimality in the design of efficient algorithms
Combination techniques and decision problems for disunification
Automorphisms in the PTIME-Turing degrees of recursive sets
Bandwidth contrained NP-complete problems
A comparison of polynomial time reducibilities
A note on a theorem of Blum, Shub, and Smale
An algorithm for the quadratic assignment problem using Benders' decomposition
One-way functions and circuit complexity
Positive relativizations of the \(P=?\) NP problem
Backtracking tactics in the backtrack method for SAT
Edge-contraction problems
The Helly property on subfamilies of limited size
The complexity of the satisfiability problem for Krom formulas
A satisfiability tester for non-clausal propositional calculus
[[:Publication:1118407|The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^Template:\mathcal L=A\Pi_ 2^Template:\mathcal L\)]]
Scheduling with semaphore constraints
Nondiamond theorems for polynomial time reducibility
A syntax-based approach to measuring the degree of inconsistency for belief bases
The computational complexity of probabilistic inference using Bayesian belief networks
Feasible arithmetic computations: Valiant's hypothesis
Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
On the complexity of string folding
Approximation algorithms for combinatorial problems
Exclusive and essential sets of implicates of Boolean functions
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Solving parity games by a reduction to SAT
Fast simplifications for Tarski formulas based on monomial inequalities
Linear programs for constraint satisfaction problems
A competitive and cooperative approach to propositional satisfiability
A simplified NP-complete satisfiability problem
Checking local optimality in constrained quadratic programming is NP- hard
Optimizing propositional calculus formulas with regard to questions of deducibility
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
Optimization, approximation, and complexity classes
A new algorithm for the propositional satisfiability problem
Nondeterminism and Boolean operations in pda's
Unique satisfiability of Horn sets can be solved in nearly linear time
The node-deletion problem for hereditary properties is NP-complete
Refutational theorem proving using term-rewriting systems
On universal learning algorithms
Stratification and knowledge base management
Non-Horn clause logic programming
Parallelizing SMT solving: lazy decomposition and conciliation
On the SPANNING k-TREE problem
Polynomial and abstract subrecursive classes
Quantum cooperative search algorithm for 3-sat
Unit disk graph recognition is NP-hard
On certain polytopes associated with graphs
Satisfiability of algebraic circuits over sets of natural numbers
A linear-time transformation of linear inequalities into conjunctive normal form
Complexity versus stability for classes of propositional formulas
Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems
The NPO-completeness of the longest Hamiltonian cycle problem
Constrained multi-object auctions and b-matching
On edge transitivity of directed graphs
Minimum disclosure proofs of knowledge
Structure preserving reductions among convex optimization problems
Ordered vertex removal and subgraph problems
Lower bounds on the size of sweeping automata
Riemann's hypothesis and tests for primality
NP-complete decision problems for binary quadratics
Local search and the local structure of NP-complete problems
Candidate keys for relations
Binary interactions and subset choice
On the equivalence, containment, and covering problems for the regular and context-free languages
Cook versus Karp-Levin: Separating completeness notions if NP is not small
Succinct circuit representations and leaf language classes are basically the same concept
On the theory of the PTIME degrees of the recursive sets
On the number of iterations of local improvement algorithms
A weight-balanced branching rule for SAT
An efficient algorithm for the 3-satisfiability problem
An observation on time-storage trade off

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138187)