๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Application of separability and independence notions for proving lower bounds of circuit complexity

โœ Scribed by D. Yu. Grigor'ev

Publisher
Springer US
Year
1980
Tongue
English
Weight
478 KB
Volume
14
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Upper and lower bounds for the average-c
Upper and lower bounds for the average-case complexity of path-search
โœ Pippenger, Nicholas ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB ๐Ÿ‘ 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent

A Lower Bound for Perceptrons and an Ora
A Lower Bound for Perceptrons and an Oracle Separation of the PPPHHierarchy
โœ Christer Berg; Staffan Ulfberg ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB

We show that there are functions computable by linear size boolean circuits of depth k that require superpolynomial size perceptrons of depth k&1, for k<log nร‚(6 log log n). This result implies the existence of an oracle A such that 7 p, A k 3 PP 7 p, A k & 2 and, in particular, this oracle separate

Lower Bounds for the Energy of Unit Vect
Lower Bounds for the Energy of Unit Vector Fields and Applications
โœ Etienne Sandier ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 460 KB

We prove lower bounds for the Dirichlet energy of a unit vector field defined in a perforated domain of R 2 with nonzero degree on the outer boundary in terms of the total diameter of the holes. We use this to derive lower bounds, and then compactness results for sequences (u = ) of minimizers or al