Pages that link to "Item:Q1330148"

The following pages link to On the intrinsic complexity of elimination theory (Q1330148):

Displaying 15 items.

• Black-box polynomial resultants (Q286994) (← links)
• On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
• Gröbner bases for polynomial systems with parameters (Q607062) (← links)
• Model checking in the modal \(\mu \)-calculus and generic solutions (Q633088) (← links)
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
• Lower bounds for diophantine approximations (Q1358914) (← links)
• Simplified lower bounds for polynomials with algebraic coefficients (Q1361874) (← links)
• Straight-line programs in geometric elimination theory (Q1380007) (← links)
• Continuity properties for flat families of polynomials. I: Continuous parametrizations (Q1408354) (← links)
• Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
• On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?'' (Q1913573) (← links)
• Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
• Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
• An arithmetic Poisson formula for the multi-variate resultant (Q2441516) (← links)
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)