40 results on '"Nicolai N"'
Search Results
2. Orthogonal Tropical Linear Prevarieties.
3. On Topological Lower Bounds for Algebraic Computation Trees.
4. Topological lower bounds for arithmetic networks.
5. Reachability in One-Dimensional Controlled Polynomial Dynamical Systems.
6. Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242).
7. Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems.
8. Satisfiability of Viability Constraints for Pfaffian Dynamics.
9. Pfaffian Hybrid Systems.
10. Fence facets from non-regular graphs for the linear ordering polytope.
11. A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps.
12. New complexity bounds for cylindrical decompositions of sub-pfaffian sets.
13. Bounds on numers of vectors of multiplicities for polynomials which are easy to compute.
14. Computing combinatorial types of trajectories in Pfaffian Dynamics.
15. Computing Local Dimension of a Semialgebraic Set.
16. Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.
17. Computing the Complexification of a Semi-Algebraic Set.
18. Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees.
19. Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae.
20. Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates
21. Lower bounds on testing membership to a polyhedron by algebraic decision trees.
22. A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time.
23. On topological lower bounds for algebraic computation trees.
24. Topological lower bounds for arithmetic networks.
25. Complexity of Null-and Positivstellensatz proofs.
26. Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.
27. Complexity of Computing the Local Dimension of a Semialgebraic Set.
28. Mean Cost Cyclical Games.
29. A 2-approximation algorithm for the network substitution problem.
30. Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees.
31. Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates.
32. Complexity of Stratifications of Semi-Pfaffian Sets.
33. Complexity of Finding Irreducible Components of a Semialgebraic Set.
34. Finding Irreducible Components of Some Real Transcendental Varieties.
35. The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities.
36. Counting Connected Components of a Semialgebraic Set in Subexponential Time.
37. Finding Connected Components of a Semialgebraic Set in Subexponential Time.
38. Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture).
39. Effective Quantifier Elimination over Real Closed Fields (Tutorial).
40. Solving Systems of Polynomial Inequalities in Subexponential Time.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.