Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/stacs/BuhrmanTU06>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Falk_Unger>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Harry_Buhrman>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Leen_Torenvliet>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2F11672142%5F37>
foaf:homepage	<https://doi.org/10.1007/11672142_37>
dc:identifier	DBLP conf/stacs/BuhrmanTU06 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2F11672142%5F37 (xsd:string)
dcterms:issued	2006 (xsd:gYear)
rdfs:label	Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Falk_Unger>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Harry_Buhrman>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Leen_Torenvliet>
swrc:pages	455-468 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/stacs/2006>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/stacs/BuhrmanTU06/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/stacs/BuhrmanTU06>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/stacs/stacs2006.html#BuhrmanTU06>
rdfs:seeAlso	<https://doi.org/10.1007/11672142_37>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/stacs>
dc:subject	Computational Complexity, Sparseness, Selfreducibility. (xsd:string)
dc:title	Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document