✦ LIBER ✦

A lower bound for the topological complexity of poly(D,n)

✍ Scribed by Harold Levine

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 646 KB
Volume: 5
Category: Article
ISSN: 0885-064X
DOI: 10.1016/0885-064x(89)90011-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 3n-lower bound on the network complexi

A 3n-lower bound on the network complexity of Boolean functions

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB 👁 1 views

## Abstract In this paper, we prove that the Kneser graphs defined on a ground set of __n__ elements, where __n__ is even, have their circular chromatic numbers equal to their chromatic numbers. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB

Topological lower bound on the energy of

Topological lower bound on the energy of a twisted rod

✍ John C Baez; Rossen Dandoloff 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 174 KB

A lower bound for the nondeterministic s

A lower bound for the nondeterministic space complexity of context-free recognition

✍ Helmut Alt; Viliam Geffert; Kurt Mehlhorn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Lower bounds for the complexity of polyn

Lower bounds for the complexity of polynomials

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