Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees

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

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Simulating Probabilistic by Deterministic Algebraic Computation Trees

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1985English

A Lower Bound on the Probability of Error in Multihypothesis Testing

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1995English

A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

Algebraic Operations on PQ Trees and Modular Decomposition Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Lower Bound on Minimum Lee Distance of Algebraic–geometric Codes Over Finite Fields

Electronics Letters
Electronic EngineeringElectrical
2007English

On the Lower Bound of the Number of Real Roots of a Random Algebraic Equation With Infinite Variance

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1972English

A Lower Bound on Web Services Composition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2008English

A Lower Bound on Wait-Free Counting

Journal of Algorithms
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy