✦ LIBER ✦

Lower bounds on the OBDD size of two fundamental functions' graphs

✍ Scribed by Daniel Sawitzki

Book ID: 108153485
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 155 KB
Volume: 101
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.08.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the OBDD size for graphs of bounded t

On the OBDD size for graphs of bounded tree- and clique-width

✍ Klaus Meer; Dieter Rautenbach 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 528 KB

New lower bounds on the formula size of

New lower bounds on the formula size of Boolean functions

✍ Ute Schürfeld 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 434 KB

Bounds on the lower size of A 7-critical

Bounds on the lower size of A 7-critical graph

✍ Huanping Liu; Zhongfu Zhang; Dean Shen 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 307 KB

On the size of (generalized) OBDDs for t

On the size of (generalized) OBDDs for threshold functions

✍ Beate Bollig 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 154 KB

New lower bounds for the size of edge ch

New lower bounds for the size of edge chromatic critical graphs

✍ Yue Zhao 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

## Abstract In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Δ. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004

Lower bounds on the size of sweeping aut

Lower bounds on the size of sweeping automata

✍ Michael Sipser 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 478 KB