All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Toward better formula lower bounds: The composition of a function and a universal relation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F17%3A00473043" target="_blank" >RIV/67985840:_____/17:00473043 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1137/15M1018319" target="_blank" >http://dx.doi.org/10.1137/15M1018319</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1137/15M1018319" target="_blank" >10.1137/15M1018319</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Toward better formula lower bounds: The composition of a function and a universal relation

  • Original language description

    One of the major open problems in complexity theory is proving superlogarithmic lower bounds on the depth of circuits (i.e., P ... NC1). This problem is interesting for two reasons: first, it is tightly related to understanding the power of parallel computation and of small-space computation, second, it is one of the first milestones toward proving superpolynomial circuit lower bounds. Karchmer, Raz, and Wigderson [Comput. Complexity, 5 (1995), pp. 191-204] suggested approaching this problem by proving the following conjecture: given two Boolean functions f and g, the depth complexity of the composed function g ... f is roughly the sum of the depth complexities of f and g. They showed that the validity of this conjecture would imply that P ... NC1. As a starting point for studying the composition of functions, they introduced a relation called 'the universal relation' and suggested studying the composition of universal relations.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Siam Journal on Computing

  • ISSN

    0097-5397

  • e-ISSN

  • Volume of the periodical

    46

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    18

  • Pages from-to

    114-131

  • UT code for WoS article

    000396677400006

  • EID of the result in the Scopus database

    2-s2.0-85014494342