Amanote Research

Amanote Research

    RegisterSign In

Lower Bounds for Monotone Span Programs

Computational Complexity - Switzerland
doi 10.1007/bf01202040
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
Date

March 1, 1996

Authors
Amos BeimelAnna G�lMike Paterson
Publisher

Springer Science and Business Media LLC


Related search

Superpolynomial Lower Bounds for Monotone Span Programs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1999English

Lower Bounds on the Length of Monotone Paths in Arrangements

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1991English

Lower Bounds for the Life-Span of Solutions of Nonlinear Wave Equations in Three Dimensions

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1982English

Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays - Part 1

2013English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Correction of "Optimal Bounds for Linear Functionals on Monotone Functions"

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy