Pages that link to "Item:Q1854429"

The following pages link to On the decisional complexity of problems over the reals (Q1854429):

Displaying 9 items.

• 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)
• An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095) (← links)
• A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests (Q1313712) (← links)
• Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
• Selecting the \(k\) largest elements with parity tests (Q1975371) (← links)
• (Q4011324) (← links)
• (Q4234078) (← links)
• (Q4391222) (← links)
• Delta-decision procedures for exists-forall problems over the reals (Q6039404) (← links)