𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds on the area complexity of Boolean circuits

✍ Scribed by Juraj Hromkovič; Sergej A. Ložkin; Andrej I. Rybko; Alexander A. Sapoženko; Nadežda A. Škalikova

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
1001 KB
Volume
97
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the number of Semi-Bool
A lower bound on the number of Semi-Boolean quadruple systems
✍ Marco Buratti; Alberto Del Fra 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

## Abstract A Steiner quadruple system of order 2^__n__^ is __Semi‐Boolean__ (SBQS(2^__n__^) in short) if all its derived triple systems are isomorphic to the point‐line design associated with the projective geometry __PG__(__n__−1, 2). We prove by means of explicit constructions that for any __n__

Some Lower Bounds for the Complexity of
Some Lower Bounds for the Complexity of Continuation Methods
✍ Jean-Pierre Dedieu; Steve Smale 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 222 KB

In this note we consider the zero-finding problem for a homogeneous polynomial system, The well-determined (m=n) and underdetermined (m<n) cases are considered together. We also let D=max d i , d=(d 1 , ..., d m ), and The projective Newton method has been introduced by Shub in [6] and is defined