✦ LIBER ✦

The polynomial bounds of proof complexity in Frege systems

✍ Scribed by S. R. Aleksanyan; A. A. Chubaryan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hard examples for the bounded depth Freg

✍ Eli Ben-Sasson 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 297 KB

Upper bounds on complexity of Frege proo

✍ Pavel Naumov 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 197 KB

The number of lines in Frege proofs with

✍ Alasdair Urquhart 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 74 KB

Lower bounds for the complexity of polyn

✍ Hans-Jörg Stoß 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 936 KB

Complexity bound for the absolute factor

✍ A. Ayad 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 538 KB

Bounds evaluation of coefficients in the

✍ Pietro Camarda 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 631 KB