A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/FindGHK16
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/FindGHK16
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Golovnev
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_S._Kulikov
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Edward_A._Hirsch
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Magnus_Gausdal_Find
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FFOCS.2016.19
>
foaf:
homepage
<
https://doi.org/10.1109/FOCS.2016.19
>
dc:
identifier
DBLP conf/focs/FindGHK16
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FFOCS.2016.19
(xsd:string)
dcterms:
issued
2016
(xsd:gYear)
rdfs:
label
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Golovnev
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_S._Kulikov
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Edward_A._Hirsch
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Magnus_Gausdal_Find
>
swrc:
pages
89-98
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/2016
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/FindGHK16/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/FindGHK16
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs2016.html#FindGHK16
>
rdfs:
seeAlso
<
https://doi.org/10.1109/FOCS.2016.19
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
title
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document