Pages that link to "Item:Q5736681"

The following pages link to On the Betti Numbers of Real Varieties (Q5736681):

Displaying 50 items.

• On the Betti numbers of level sets of solutions to elliptic equations (Q262118) (← links)
• Bounding the equivariant Betti numbers of symmetric semi-algebraic sets (Q340423) (← links)
• Refined bounds on the number of connected components of sign conditions on a variety (Q411399) (← links)
• An incidence theorem in higher dimensions (Q452010) (← links)
• Divide and conquer roadmap for algebraic sets (Q464736) (← links)
• Bounds of Hausdorff measures of tame sets (Q490038) (← links)
• Polynomials with dense zero sets and discrete models of the Kakeya conjecture and the Furstenberg set problem (Q508424) (← links)
• Probabilistic communication complexity (Q579927) (← links)
• Some aspects of complexity in real algebraic geometry (Q582342) (← links)
• VC dimensions of principal component analysis (Q603853) (← links)
• A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
• Algebraic decision trees and Euler characteristics (Q673780) (← links)
• Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
• A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
• On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
• Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
• Deciding consistency of systems of exponential-polynomial inequalities in subexponential time (Q684954) (← links)
• Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715) (← links)
• An opportunistic global path planner (Q686736) (← links)
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
• Zarankiewicz's problem for semi-algebraic hypergraphs (Q721064) (← links)
• Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
• Geometric properties of the ridge function manifold (Q849339) (← links)
• Growth of critical points in 1-dimensional lattice systems (Q891346) (← links)
• Semi-algebraic Ramsey numbers (Q896011) (← links)
• On triple intersections of three families of unit circles (Q908211) (← links)
• Bezout theorem for Nash functions (Q916744) (← links)
• Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time (Q937274) (← links)
• Computing the first Betti number of a semi-algebraic set (Q937278) (← links)
• A sharper estimate on the Betti numbers of sets defined by quadratic inequalities (Q938303) (← links)
• Edge intersection graphs of systems of paths on a grid with a bounded number of bends (Q967371) (← links)
• Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials (Q967467) (← links)
• An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions (Q987564) (← links)
• Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials (Q1024388) (← links)
• Estimates of real roots of a system of algebraic equations (Q1077879) (← links)
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) (Q1086843) (← links)
• Remainder estimates in spectral asymptotic formulas for linear operator pencils (Q1095373) (← links)
• A variant of Ben-Or's lower bound for algebraic decision trees (Q1096401) (← links)
• Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
• Weak (1,1) bounds for oscillatory singular integrals (Q1117418) (← links)
• Counting types of rigid frameworks (Q1136355) (← links)
• Complexity of computations in Commutative Division of the USSR Academy of Sciences (Q1173942) (← links)
• Bounding the number of connected components of a real algebraic set (Q1174716) (← links)
• The complexity of point configurations (Q1175788) (← links)
• A lower bound for the integer element distinctness problem (Q1175947) (← links)
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
• How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
• The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
• Spectral geometry of semi-algebraic sets (Q1203368) (← links)