Pages that link to "Item:Q3730348"
From MaRDI portal
The following pages link to A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348):
Displaying 13 items.
- A linear-time transformation of linear inequalities into conjunctive normal form (Q293409) (← links)
- Minimum sum of diameters clustering (Q581969) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Computational experience with an interior point algorithm on the satisfiability problem (Q753688) (← links)
- Modeling and integer programming techniques applied to propositional calculus (Q918954) (← links)
- A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- Binary integer programs with two variables per inequality (Q1363421) (← links)
- A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning (Q1626771) (← links)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- On the r,s-SAT satisfiability problem and a conjecture of Tovey (Q1822964) (← links)
- A threshold for unsatisfiability (Q5096838) (← links)
