Lower Bounds on the Depth of Monotone Arithmetic Computations

Don Coppersmith; Baruch Schieber

doi:10.1006/jcom.1998.0494

ScienceGate Book Chapters

JOURNAL ARTICLE

Lower Bounds on the Depth of Monotone Arithmetic Computations

Don Coppersmith Baruch Schieber

Year: 1999 Journal: Journal of Complexity Vol: 15 (1)Pages: 17-29 Publisher: Elsevier BV

DOI: 10.1006/jcom.1998.0494

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Computation Conjecture Monotone polygon Binary tree Constant (computer programming) Combinatorics Expression (computer science) Binary number Upper and lower bounds Tree (set theory) Discrete mathematics Arithmetic Algorithm Geometry Computer science Mathematical analysis

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.25

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

semigroups and automata theory

Physical Sciences → Computer Science → Computational Theory and Mathematics

Lower Bounds on the Depth of Monotone Arithmetic Computations

Metrics

Topics

Related Documents

Lower bounds on the depth of monotone arithmetic computations

Monotone Depth Lower Bounds

Finite limits and monotone computations: the lower bounds criterion

Lower bounds for bounded depth arithmetic circuits

Lower bounds for monotone arithmetic circuits via communication complexity