On P versus NP cap co-NP for Decision Trees and Read-Once Branching Programs.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F99%3A06020141" target="_blank" >RIV/67985807:_____/99:06020141 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

On P versus NP cap co-NP for Decision Trees and Read-Once Branching Programs.

Original language 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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F95%2F0976" target="_blank" >GA201/95/0976: HYPERCOMPLEX:Complexity Issues in High Performance Computing</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

1999

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Computational Complexity

ISSN

1016-3328

e-ISSN

—

Volume of the periodical

8

Issue of the periodical within the volume

N/A

Country of publishing house

CH - SWITZERLAND

Number of pages

14

Pages from-to

357-370

UT code for WoS article

—

EID of the result in the Scopus database

—