𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of Hard-Core Set Proofs

✍ Scribed by Chi-Jen Lu; Shi-Chun Tsai; Hsin-Lung Wu

Publisher
Springer
Year
2011
Tongue
English
Weight
356 KB
Volume
20
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity of Null- and Positivstellensa
Complexity of Null- and Positivstellensatz proofs
✍ Dima Grigoriev; Nicolai Vorobjov πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 91 KB

We introduce two versions of proof systems dealing with systems of inequalities: Positivstellensatz refutations and Positivstellensatz calculus. For both systems we prove the lower bounds on degrees and lengths of derivations for the example due to Lazard, Mora and Philippon. These bounds are sharp,

On the complexity of cutting-plane proof
On the complexity of cutting-plane proofs
✍ W. Cook; C.R. Coullard; Gy. TurΓ‘n πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 881 KB