This HTML5 document contains 28 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n14http://courses.cs.vt.edu/cs4124/fall2005/resources/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Lupanov_representation
rdfs:label
Lupanov representation
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.
dcterms:subject
dbc:Boolean_algebra dbc:Circuit_complexity
dbo:wikiPageID
24700145
dbo:wikiPageRevisionID
1100746989
dbo:wikiPageWikiLink
dbr:Circuit_complexity dbc:Boolean_algebra dbr:Boolean_functions dbr:Oleg_Lupanov dbr:Claude_Shannon dbc:Circuit_complexity dbr:Iff dbr:Boolean_circuit
dbo:wikiPageExternalLink
n14:lupanov.pdf n14:lupanov_example.pdf
owl:sameAs
freebase:m.0807dxn n15:4r4bY wikidata:Q6704662
dbp:wikiPageUsesTemplate
dbt:Unreferenced dbt:Cleanup
dbp:date
August 2014
dbp:reason
Incomplete definition
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.
gold:hypernym
dbr:Way
prov:wasDerivedFrom
wikipedia-en:Lupanov_representation?oldid=1100746989&ns=0
dbo:wikiPageLength
1849
foaf:isPrimaryTopicOf
wikipedia-en:Lupanov_representation