✦ LIBER ✦

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations

✍ Scribed by Ryo Yoshinaka; Jun Kawahara; Shuhei Denzumi; Hiroki Arimura; Shin-ichi Minato

Book ID: 116577118
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 179 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.05.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simpler counterexample to a long-stand

A simpler counterexample to a long-standing conjecture on the complexity of Bryantʼs apply algorithm

✍ Bollig, Beate 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 242 KB

On the Structure of Counterexamples to S

On the Structure of Counterexamples to Symmetric Orderings for BDD's

✍ Rakesh M. Verma; Sarah B. Hwang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Counterexample to the Conjecture on Mono

Counterexample to the Conjecture on Monotonicity of a Gaussian Integral

✍ A. V. Sudakov 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 239 KB

On the Sternfeld-Levin counterexamples t

On the Sternfeld-Levin counterexamples to a conjecture of Chogoshvili-Pontrjagin

✍ Fredric D. Ancel; Tadeusz Dobrowolski 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 854 KB

An inconclusive proof in a 1937 paper by G. Chogoshvili spawned an interesting dimensiontheoretic conjecture which we call the Chogoshvili-Pontrjagin Conjecture. In 1991, Y. Stemfeld found an ingenious counterexample to this conjecture which he and M. Levin greatly generalized in 1995. In this note

On the connectivity of minimum and minim

On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture

✍ Ken-ichi Kawarabayashi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 116 KB

A counterexample to a conjecture on the

A counterexample to a conjecture on the bondage number of a graph

✍ Ulrich Teschner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.