Publication:5511997

From MaRDI portal
Revision as of 04:13, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath0137.42503MaRDI QIDQ5511997

René Thom

Publication date: 1965




Related Items

Un théorème de Zariski du type de Lefschetz, Bounding Helly Numbers via Betti Numbers, On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines, Kac’s random walk on the special orthogonal group mixes in polynomial time, Improved Bounds for Incidences Between Points and Circles, Sums of Betti numbers in arbitrary characteristic., Decision tree complexity and Betti numbers, Crossing patterns of segments, Horizontal gradient of polynomial functions for the standard Engel structure on \(\mathbb R^4\), On the Betti Numbers of Real Varieties, On the Betti numbers of level sets of solutions to elliptic equations, Bounding the equivariant Betti numbers of symmetric semi-algebraic sets, Refined bounds on the number of connected components of sign conditions on a variety, An incidence theorem in higher dimensions, Divide and conquer roadmap for algebraic sets, Polynomials with dense zero sets and discrete models of the Kakeya conjecture and the Furstenberg set problem, Some aspects of complexity in real algebraic geometry, Algebraic decision trees and Euler characteristics, Semi-algebraic Ramsey numbers, On triple intersections of three families of unit circles, Bezout theorem for Nash functions, A sharper estimate on the Betti numbers of sets defined by quadratic inequalities, Edge intersection graphs of systems of paths on a grid with a bounded number of bends, Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials, Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials, A variant of Ben-Or's lower bound for algebraic decision trees, Bounding the number of connected components of a real algebraic set, A lower bound for the integer element distinctness problem, Spectral geometry of semi-algebraic sets, Betti numbers of semi-Pfaffian sets, Some speed-ups and speed limits for real algebraic geometry, \(M\)-curves and symmetric products, Homology of semi-pfaffian sets, Systems of rational polynomial equations have polynomial size approximate zeros on the average, Computing the Betti numbers of arrangements via spectral sequences, On the distortion required for embedding finite metric spaces into normed spaces, Semi-algebraic decision complexity, the real spectrum, and degree, On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\)., Distinct distances on curves via rigidity, Distinct distance estimates and low degree polynomial partitioning, A complexity theory of constructible functions and sheaves, Computing the first few Betti numbers of semi-algebraic sets in single exponential time, Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets, The number of disk graphs, A semi-algebraic version of Zarankiewicz's problem, On the number of zero-patterns of a sequence of polynomials, Generic Finiteness for Dziobek Configurations, Book Review: Real solutions to equations from geometry, New equations for central configurations and generic finiteness, On the Betti numbers of sign conditions, Ramsey-type results for semi-algebraic relations, Betti number bounds for fewnomial hypersurfaces via stratified Morse theory, Harnack-Thom theorem for higher cycle groups and Picard varieties, Unnamed Item