Pages that link to "Item:Q4736755"
From MaRDI portal
The following pages link to On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries (Q4736755):
Displaying 8 items.
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
