Pages that link to "Item:Q1254112"
From MaRDI portal
The following pages link to A linear-time algorithm for testing the truth of certain quantified Boolean formulas (Q1254112):
Displaying 50 items.
- Models and quantifier elimination for quantified Horn formulas (Q944709) (← links)
- Algorithms for media (Q947070) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization (Q955309) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- Uniquely solvable quadratic Boolean equations (Q1070255) (← links)
- An extension of the König-Egerváry property to node-weighted bidirected graphs (Q1108202) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- A fast algorithm for solving systems of linear equations with two variables per equation (Q1149227) (← links)
- A switching algorithm for the solution of quadratic Boolean equations (Q1153123) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization (Q1276959) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- The unique Horn-satisfiability problem and quadratic Boolean equations. (Q1353999) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- On renamable Horn and generalized Horn functions (Q1356207) (← links)
- On-line 2-satisfiability (Q1356216) (← links)
- Positive and Horn decomposability of partially defined Boolean functions (Q1356507) (← links)
- An algorithm reconstructing convex lattice sets. (Q1401390) (← links)
- Non-Horn clause logic programming (Q1402738) (← links)
- The maximum length of prime implicates for instances of 3-SAT (Q1402744) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- Reconstruction of convex 2D discrete sets in polynomial time (Q1603651) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections (Q1606912) (← links)
- Random 2-SAT and unsatisfiability (Q1607007) (← links)
- Disjunctions, independence, refinements (Q1614865) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- Recognition of unipolar and generalised split graphs (Q1736638) (← links)
- Co-clustering under the maximum norm (Q1736769) (← links)
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- An algorithmic framework for labeling network maps (Q1750356) (← links)
- Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances (Q1776200) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Toward leaner binary-clause reasoning in a satisfiability solver (Q1777406) (← links)