✦ LIBER ✦

The complexity of semilinear problems in succinct representation

✍ Scribed by Peter Bürgisser; Felipe Cucker; Paulin Jacobé de Naurois

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The computational complexity of graph pr

✍ M. Karpinski; K. W. Wagner 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 451 KB

On the succinct representation of graphs

✍ György Turán 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 371 KB

On the Complexity of Succinct Zero-Sum G

✍ Lance Fortnow; Russell Impagliazzo; Valentine Kabanets; Christopher Umans 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 557 KB

Relativized Gödel speed-up and the degre

✍ Martin K. Solomon 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB

On the complexity of achieving proportio

✍ Ariel D. Procaccia; Jeffrey S. Rosenschein; Aviv Zohar 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 144 KB

Equivalence in the complexity of several

✍ E. A. Ivanov 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 422 KB