Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by N. Vorobjov
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Related publications
Simulating Probabilistic by Deterministic Algebraic Computation Trees
Theoretical Computer Science
Computer Science
Theoretical Computer Science
A Lower Bound on the Probability of Error in Multihypothesis Testing
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower Bound on Minimum Lee Distance of Algebraic–geometric Codes Over Finite Fields
Electronics Letters
Electronic Engineering
Electrical
On the Lower Bound of the Number of Real Roots of a Random Algebraic Equation With Infinite Variance
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
A Lower Bound on Web Services Composition
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
A Lower Bound on Wait-Free Counting
Journal of Algorithms
