An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Lupanov's (k, s)-representation, named after Oleg Lupanov, is a way of representing Boolean circuits so as to show that the reciprocal of the Shannon effect. Shannon had showed that almost all Boolean functions of n variables need a circuit of size at least 2nn−1. The reciprocal is that: All Boolean functions of n variables can be computed with a circuit of at most 2nn−1 + o(2nn−1) gates.

Property Value
dbo:abstract
  • Lupanov's (k, s)-representation, named after Oleg Lupanov, is a way of representing Boolean circuits so as to show that the reciprocal of the Shannon effect. Shannon had showed that almost all Boolean functions of n variables need a circuit of size at least 2nn−1. The reciprocal is that: All Boolean functions of n variables can be computed with a circuit of at most 2nn−1 + o(2nn−1) gates. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 24700145 (xsd:integer)
dbo:wikiPageLength
  • 1849 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1100746989 (xsd:integer)
dbo:wikiPageWikiLink
dbp:date
  • August 2014 (en)
dbp:reason
  • Incomplete definition (en)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdfs:comment
  • Lupanov's (k, s)-representation, named after Oleg Lupanov, is a way of representing Boolean circuits so as to show that the reciprocal of the Shannon effect. Shannon had showed that almost all Boolean functions of n variables need a circuit of size at least 2nn−1. The reciprocal is that: All Boolean functions of n variables can be computed with a circuit of at most 2nn−1 + o(2nn−1) gates. (en)
rdfs:label
  • Lupanov representation (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License