Lower Bounds on the Length of Monotone Paths in Arrangements

Discrete and Computational Geometry - United States
doi 10.1007/bf02574679
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Long Monotone Paths in Line Arrangements

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2004English

Lower Bounds for Monotone Span Programs

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
1996English

Superpolynomial Lower Bounds for Monotone Span Programs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1999English

Tight Upper and Lower Bounds on the Path Length of Binary Trees

SIAM Journal on Computing
MathematicsComputer Science
1994English

Lower Bounds for the Length of Reset Words in Eulerian Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Computer NetworksOpticsMolecular Physics,CommunicationsOpticalAtomicMagnetic MaterialsElectronic
2007English

Input Distance and Lower Bounds for Propositional Resolution Proof Length

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Lower Bounds

2016English

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

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

Privacy PolicyRefund Policy