✦ LIBER ✦

On the algorithmic complexity of static structures

✍ Scribed by Joel Ratsaby; J. Chaskalovic

Book ID: 107347244
Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2010
Tongue: English
Weight: 414 KB
Volume: 23
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-010-8465-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Algorithmic Complexity of Total D

✍ Laskar, Renu; Pfaff, John; Hedetniemi, S. M.; Hedetniemi, S. T. 📂 Article 📅 1984 🏛 Society for Industrial and Applied Mathematics ⚖ 629 KB

The algorithmic complexity of colour swi

✍ Yeow Meng Chee; Andrew Lim 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 477 KB

On the algorithmic complexity of a probl

✍ A. V. Dolgushev; A. V. Kel’manov 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 440 KB

On the algorithmic effectiveness of digr

✍ Michael Lampis; Georgia Kaouri; Valia Mitsou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 321 KB

The algorithmic complexity of minus domi

✍ Jean Dunbar; Wayne Goddard; Stephen Hedetniemi; Alice McRae; Michael A. Henning 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 796 KB

On the algorithmic complexity of colorin

✍ Kevin T. Phelps; Vojtěch Rödl 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 474 KB