✦ LIBER ✦

Proof of Rueppel's linear complexity conjecture (Corresp.)

✍ Scribed by Zong-Duo Dai

Book ID: 114636575
Publisher: IEEE
Year: 1986
Tongue: English
Weight: 504 KB
Volume: 32
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1986.1057174

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The proof complexity of linear algebra

✍ Michael Soltys; Stephen Cook 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Asymptotic behavior of Golomb's conjectu

Asymptotic behavior of Golomb's conjecture (Corresp.)

✍ Fredricksen, H. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 297 KB

Optimization complexity of linear logic

Optimization complexity of linear logic proof games

✍ Patrick D. Lincoln; John C. Mitchell; Andre Scedrov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 218 KB

A class of linear logic proof games is developed, each with a numeric score that depends on the number of preferred axioms used in a complete or partial proof tree. The complexity of these games is analyzed for the NP-complete multiplicative fragment (MLL) extended with additive constants and the PS

Elementary Proof of MacMahon's Conjectur

Elementary Proof of MacMahon's Conjecture

✍ David M. Bressoud 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 96 KB

A proof of Ehrenfeucht's Conjecture

✍ M.H. Albert; J. Lawrence 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 153 KB

A proof of snevily’s conjecture

✍ Bodan Arsovski 📂 Article 📅 2011 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 157 KB