Treffer: nΩ(logn) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
Title:
nΩ(logn) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
Authors:
Source:
Information processing letters. 45(6):303-307
Publisher Information:
Amsterdam: Elsevier Science, 1993.
Publication Year:
1993
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Calculabilité, Computability, Calculabilidad, Complexité calcul, Computing complexity, Complejidad cálculo, Limite inférieure, Lower bound, Límite inferior, Circuit seuil, Threshold circuit
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Steklov mathematical inst., 117966 Moscow, Russian Federation
ISSN:
0020-0190
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4802724
Database:
PASCAL Archive
Weitere Informationen
We present a function in ACC0 such that any depth-3 threshold circuit which computes this function and has AND gates at the bottom must have size nΩ(log n).