Communication complexity towards lower bounds on circuit depth.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F01%3A05020113" target="_blank" >RIV/67985840:_____/01:05020113 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Communication complexity towards lower bounds on circuit depth.

Original language description

Karchmer, Raz, and Wigderson, 1995, discuss the circuit depth complexity of $n$ bit Boolean functions constructed by composing up to $d = log n /log log n$ levels of $k = log n$ bit Boolean functions. In order to develop techniques for using commu

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

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

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

Publication year

2001

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

10

Issue of the periodical within the volume

3

Country of publishing house

CH - SWITZERLAND

Number of pages

37

Pages from-to

210-246

UT code for WoS article

—

EID of the result in the Scopus database

—