The following pages link to (Q4218098):
Displaying 11 items.
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- On the hardness of approximating label-cover (Q1029090) (← links)
- On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations (Q2095546) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- Frugal Routing on Wireless Ad-Hoc Networks (Q5459979) (← links)
