About: On P versus NP cap co-NP for Decision Trees and Read-Once Branching Programs.     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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. (en)
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. (en)
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. (en)
skos:notation
  • RIV/67985807:_____/99:06020141!RIV/2003/AV0/A06003/N
http://linked.open.../vavai/riv/strany
  • 357;370
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/95/0976), Z(AV0Z1030915)
http://linked.open...iv/cisloPeriodika
  • N/A
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 748421
http://linked.open...ai/riv/idVysledku
  • RIV/67985807:_____/99:06020141
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • computational complexity; Boolean functions; decision trees; branching programs; P versus NP intersection co-NP (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • CH - Švýcarská konfederace
http://linked.open...ontrolniKodProRIV
  • [A489F02C6866]
http://linked.open...i/riv/nazevZdroje
  • Computational Complexity
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 8
http://linked.open...iv/tvurceVysledku
  • Savický, Petr
  • Jukna, S.
  • Wegener, I.
  • Razborov, A.
http://linked.open...n/vavai/riv/zamer
issn
  • 1016-3328
number of pages
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software