Concepedia

Nicolai Vorobjov

NV

21

Publications

828

Citations

14

H-Index

1988

Active since

Affiliations

University of Bath(Current)

Université de Rennes

Purdue University West Lafayette

Institut de recherche mathématique de Rennes

Centre National de la Recherche Scientifique

Nicolai Vorobjov is an author at University of Bath specializing in engineering, computational complexity, and discrete mathematics.

Top concepts

EngineeringComputational ComplexityDiscrete MathematicsCombinatorial OptimizationComputer ScienceDiscrete GeometryApproximation TheoryMathematical ProgrammingRepresentation TheoryComplexity

Publications per year

1988–2015

21

Publications

21

Solving systems of polynomial inequalities in subexponential time

D. Yu. Grigor'ev, Nicolai Vorobjov · Journal of Symbolic Computation · 1988 · 325 citations

Mathematical Programming, Polynomial Inequalities, Engineering +5

Complexity of Null- and Positivstellensatz proofs

Dima Grigoriev, Nicolai Vorobjov · Annals of Pure and Applied Logic · 2001 · 100 citations

Engineering, Proof Complexity, Algebraic Method +3

Counting connected components of a semialgebraic set in subexponential time

D. Yu. Grigor'ev, Nicolai Vorobjov · Computational Complexity · 1992 · 74 citations

Topological Semigroups, Transformation Semigroups, Subexponential Time

BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS

Andrei Gabrielov, Nicolai Vorobjov, Thierry Zell · Journal of the London Mathematical Society · 2004 · 36 citations

Spectral Theory, Schubert Calculus, Engineering +6

Complexity of stratification of semi-Pfaffian sets

Andrei Gabrielov, Nicolai Vorobjov · Discrete & Computational Geometry · 1995 · 35 citations · Full text

Semi-pfaffian Sets, Combinatorial Design, Extremal Set Theory +3

Rows per page

1–5 of 21