On Computing Boolean Functions by Sparse Real Polynomials.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/KrauseP95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/KrauseP95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Matthias_Krause_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pavel_Pudl%E2%88%9A%C2%B0k
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492670
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1995.492670
>
dc:
identifier
DBLP conf/focs/KrauseP95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1995.492670
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
On Computing Boolean Functions by Sparse Real Polynomials.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Matthias_Krause_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pavel_Pudl%E2%88%9A%C2%B0k
>
swrc:
pages
682-691
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/KrauseP95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/KrauseP95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs95.html#KrauseP95
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1995.492670
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
Boolean functions; computational complexity; polynomials; Boolean functions; sparse real polynomials; complexity; polynomials; threshold-parity circuits; threshold-and circuits
(xsd:string)
dc:
title
On Computing Boolean Functions by Sparse Real Polynomials.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document