Pages that link to "Item:Q4369892"
From MaRDI portal
The following pages link to A class of logic problems solvable by linear programming (Q4369892):
Displayed 14 items.
- Optimization and probabilistic satisfiability on nested and co-nested formulas (Q646722) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Ideal clutters (Q697573) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees (Q1296806) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Probability logic and optimization SAT: The PSAT and CPA models (Q1777404) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- A short note on some tractable cases of the satisfiability problem. (Q1854345) (← links)
- Structural properties of affine sparsity constraints (Q2425165) (← links)
- Balanced matrices (Q2433704) (← links)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
- Perfect, ideal and balanced matrices (Q5943927) (← links)