Algorithmic and Quantitative Real Algebraic Geometry: DIMACS Workshop, Algorithmic and Quantitative Aspects of Real Algebraic, Geometry in Mathematics and Computer Science, March 12-16, 2001, DIMACS CenterSaugata Basu, Laureano González-Vega American Mathematical Soc., 1. jan. 2003 - 219 sider Algorithmic and quantitative aspects in real algebraic geometry are becoming increasingly important areas of research because of their roles in other areas of mathematics and computer science. The papers in this volume collectively span several different areas of current research. The articles are based on talks given at the DIMACS Workshop on ''Algorithmic and Quantitative Aspects of Real Algebraic Geometry''. Topics include deciding basic algebraic properties of real semi-algebraic sets, application of quantitative results in real algebraic geometry towards investigating the computational complexity of various problems, algorithmic and quantitative questions in real enumerative geometry, new approaches towards solving decision problems in semi-algebraic geometry, as well as computing algebraic certificates, and applications of real algebraic geometry to concrete problems arising in robotics and computer graphics. The book is intended for researchers interested in computational methods in algebra. |
Indhold
| 1 | |
| 13 | |
Combinatorial characterizations of algebraic sets | 23 |
223 | 52 |
On the number of connected components of the relative closure of | 65 |
How to show a set is not algebraic | 77 |
Efficient algorithms based on critical points method | 123 |
Enumerative real algebraic geometry | 139 |
Combinatorial roadmaps in configuration spaces of simple planar polygons | 181 |
From discrete algorithms to real algebraic geometry | 207 |
Andre udgaver - Se alle
Algorithmic and Quantitative Real Algebraic Geometry: DIMACS Workshop ... Saugata Basu Begrænset visning - 2003 |
Almindelige termer og sætninger
algebraic computation trees algorithm alignment event archimedean B₁ basic Betti numbers coefficients combinatorial common tangent lines compact condition Conjecture 5.1 connected components constructible functions convex hull coordinates critical points curve decision complexity defined Degree Bound denote dimension embedding enumerative geometry enumerative problems equations Euler characteristic example exists fewnomial finite given Grassmannian Gröbner bases Gröbner basis Henneberg homeomorphic homotopy implies inequalities integer intersection irreducible k-planes Laman graph Lemma linear lower bound Math Mathematics matrix method monomials number of connected number of real optimal Pfaffian planar plane Plücker coordinates polygon polynomial systems positive preprime proof quadratic rational normal curve Real Algebraic Geometry real algebraic set real numbers real solutions representation result Schubert calculus Schubert varieties semi-Pfaffian set semialgebraic set semidefinite programming singular solving space subset subspaces sum of squares Theorem topological transverse triangular set triangulation variables vertex vertices
Populære passager
Side 219 - Conference 57 Eugene C. Freuder and Richard J. Wallace, Editors, Constraint Programming and Large Scale Discrete Optimization 56 Alexander Barg and Simon Litsyn, Editors, Codes and Association Schemes 55 Ding-Zhu Du, Panos M.
Side 219 - Neil Immerman and Phokion G. Kolaitis, Editors, Descriptive Complexity and Finite Models 30 Sandeep N. Bhatt, Editor, Parallel Algorithms: Third DIMACS Implementation Challenge 29 Doron A. Peled, Vaughan R. Pratt, and Gerard J. Holzmann, Editors, Partial Order Methods in Verification 28 Larry Finkelstein and William M.
Side 216 - PK Agarwal. B. Aronov, and M Sharir. Line transversals of balls and smallest enclosing cylinders in three dimensions.
Side 52 - A. Borel and JC Moore, Homology theory for locally compact spaces. Michigan Math. J. 7 [1960], 137-159.
Side 216 - M. Bern, D. Dobkin, D. Eppstein, and R. Grossman. Visibility with a moving point of view. Algorithmica, 11:360-378, 1994.
Side 176 - IN Bernstein, IM Gelfand and SI Gelfand, Schubert cells and cohomology of the spaces G/P, Russian Math.
Side 52 - A. Bjorner, L. Lovasz and A. Yao, Linear decision trees: volume estimates and topological bounds, Proc. 24th ACM Symp. on Theory of Computing (May 1992), ACM Press , New York, 1992, 170-177.
Side 176 - D. Eisenbud and J. Harris, Divisors on general curves and cuspidal rational curves. Invent. Math. 74 (1983), 371-418.