Multi-linear formulas for permanent and determinant are of super-polynomial size.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/stoc/Raz04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Raz04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ran_Raz
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1007352.1007353
>
foaf:
homepage
<
https://doi.org/10.1145/1007352.1007353
>
dc:
identifier
DBLP conf/stoc/Raz04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1007352.1007353
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
rdfs:
label
Multi-linear formulas for permanent and determinant are of super-polynomial size.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ran_Raz
>
swrc:
pages
633-641
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/stoc/2004
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/stoc/Raz04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/stoc/Raz04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/stoc/stoc2004.html#Raz04
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1007352.1007353
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/stoc
>
dc:
subject
algebraic complexity, arithmetic formulas, circuit complexity, computational complexity, lower bounds
(xsd:string)
dc:
title
Multi-linear formulas for permanent and determinant are of super-polynomial size.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document