Attributes | Values |
---|
rdf:type
| |
Description
| - One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., ...). This problem is interesting for two reasons: first, it is tightly related to understanding the power of parallel computation and of small-space computation; second, it is one of the first milestones toward proving super-polynomial circuit lower bounds. In this work, we make a natural step in this direction, which lies between what is known and the original conjecture: we show that an analogue of the KRW Composition Conjecture holds for the composition of a function with a universal relation.
- One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., ...). This problem is interesting for two reasons: first, it is tightly related to understanding the power of parallel computation and of small-space computation; second, it is one of the first milestones toward proving super-polynomial circuit lower bounds. In this work, we make a natural step in this direction, which lies between what is known and the original conjecture: we show that an analogue of the KRW Composition Conjecture holds for the composition of a function with a universal relation. (en)
|
Title
| - Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture (en)
|
skos:prefLabel
| - Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture (en)
|
skos:notation
| - RIV/67985840:_____/14:00434460!RIV15-GA0-67985840
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/67985840:_____/14:00434460
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - formula lower bounds; information complexity; composition conjecture (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014)
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Gavinsky, Dmitry
- Meir, O.
- Weinstein, O.
- Wigderson, A.
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |