This HTML5 document contains 46 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/
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/zamer/
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985807%3A_____%2F99%3A06020141%21RIV%2F2003%2FAV0%2FA06003%2FN/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985807%3A_____%2F99%3A06020141%21RIV%2F2003%2FAV0%2FA06003%2FN
rdf:type
skos:Concept n16:Vysledek
dcterms:description
It is known that if a Boolean function f in n variables has a DNF and a CNF of size at most N then f also has a decision tree of size exp(O(log n log^2 N)). We show that this simulation cannot be made polynomial: we exhibit explicit Boolean functions f that require decision trees of size exp(Omega)log^2 N)) where N is the total number of monomials in minimal DNFs for f and not f. Moreover, we exhibit new exponential lower bounds on read-once branching program size for explicit Boolean functions. It is known that if a Boolean function f in n variables has a DNF and a CNF of size at most N then f also has a decision tree of size exp(O(log n log^2 N)). We show that this simulation cannot be made polynomial: we exhibit explicit Boolean functions f that require decision trees of size exp(Omega)log^2 N)) where N is the total number of monomials in minimal DNFs for f and not f. Moreover, we exhibit new exponential lower bounds on read-once branching program size for explicit Boolean functions.
dcterms:title
On P versus NP cap co-NP for Decision Trees and Read-Once Branching Programs. On P versus NP cap co-NP for Decision Trees and Read-Once Branching Programs.
skos:prefLabel
On P versus NP cap co-NP for Decision Trees and Read-Once Branching Programs. On P versus NP cap co-NP for Decision Trees and Read-Once Branching Programs.
skos:notation
RIV/67985807:_____/99:06020141!RIV/2003/AV0/A06003/N
n4:strany
357;370
n4:aktivita
n12:P n12:Z
n4:aktivity
P(GA201/95/0976), Z(AV0Z1030915)
n4:cisloPeriodika
N/A
n4:dodaniDat
n5:2003
n4:domaciTvurceVysledku
n13:3559491
n4:druhVysledku
n14:J
n4:duvernostUdaju
n15:S
n4:entitaPredkladatele
n6:predkladatel
n4:idSjednocenehoVysledku
748421
n4:idVysledku
RIV/67985807:_____/99:06020141
n4:jazykVysledku
n8:eng
n4:klicovaSlova
computational complexity; Boolean functions; decision trees; branching programs; P versus NP intersection co-NP
n4:klicoveSlovo
n7:Boolean%20functions n7:decision%20trees n7:P%20versus%20NP%20intersection%20co-NP n7:computational%20complexity n7:branching%20programs
n4:kodStatuVydavatele
CH - Švýcarská konfederace
n4:kontrolniKodProRIV
[A489F02C6866]
n4:nazevZdroje
Computational Complexity
n4:obor
n18:BA
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
4
n4:pocetUcastnikuAkce
0
n4:pocetZahranicnichUcastnikuAkce
0
n4:projekt
n9:GA201%2F95%2F0976
n4:rokUplatneniVysledku
n5:1999
n4:svazekPeriodika
8
n4:tvurceVysledku
Savický, Petr Razborov, A. Wegener, I. Jukna, S.
n4:zamer
n17:AV0Z1030915
s:issn
1016-3328
s:numberOfPages
14