Near-Optimal Small-Depth Lower Bounds for Small
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10331481" target="_blank" >RIV/00216208:11320/16:10331481 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/2897518.2897534" target="_blank" >http://dx.doi.org/10.1145/2897518.2897534</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2897518.2897534" target="_blank" >10.1145/2897518.2897534</a>
Alternative languages
Result language
angličtina
Original language name
Near-Optimal Small-Depth Lower Bounds for Small
Original language description
We prove a lower bound for the s-t connectivity restricted to distance k for depth d circuits. Our lower bound is almost optimal.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
48th Annual Symposium on the Theory of Computing
ISBN
978-1-4503-4132-5
ISSN
—
e-ISSN
—
Number of pages
14
Pages from-to
612-625
Publisher name
ACM Press
Place of publication
Cambridge, MA, USA
Event location
USA
Event date
Jun 18, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—