On the Complexity of Boolean Functions Computed by Lazy Oracles.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tc/DunneLN95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tc/DunneLN95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Gerald_F._Nwana
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paul_E._S._Dunne
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paul_H._Leng
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F12.376165
>
foaf:
homepage
<
https://doi.org/10.1109/12.376165
>
dc:
identifier
DBLP journals/tc/DunneLN95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F12.376165
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tc
>
rdfs:
label
On the Complexity of Boolean Functions Computed by Lazy Oracles.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Gerald_F._Nwana
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paul_E._S._Dunne
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paul_H._Leng
>
swrc:
number
4
(xsd:string)
swrc:
pages
495-502
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tc/DunneLN95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tc/DunneLN95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tc/tc44.html#DunneLN95
>
rdfs:
seeAlso
<
https://doi.org/10.1109/12.376165
>
dc:
subject
Circuit simulation, Boolean function complexity, demand-driven simulation, symmetric Boolean functions, lazy evaluation.
(xsd:string)
dc:
title
On the Complexity of Boolean Functions Computed by Lazy Oracles.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
44
(xsd:string)