✦ LIBER ✦

An upper bound for the circuit complexity of existentially quantified Boolean formulas

✍ Scribed by H. Kleine Büning; A. Remshagen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the complexity of tra

✍ Stuart W Margolis; Bret Tilson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Lower bounds for the complexity of relia

✍ Gacs, P.; Gal, A. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 561 KB

An Improved Upper Complexity Bound for t

✍ Laureano González-Vega; M'hammed El Kahoui 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 321 KB

An explicit formula for eigenvalues of B

✍ Oscar Rojo; María Robbiano 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 171 KB

An upper bound of the number of tests in

✍ Hong-Bin Chen; Hung-Lin Fu; Frank K. Hwang 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 131 KB

Upper bounds for the first dirichlet eig

✍ M. Carmen Domingo-Juan; Ana Lluch; Vicente Miquel 📂 Article 📅 2011 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 263 KB