Pages that link to "Item:Q3933758"
From MaRDI portal
The following pages link to Lower bounds for algebraic decision trees (Q3933758):
Displayed 33 items.
- Algebraic decision trees and Euler characteristics (Q673780) (← links)
- Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715) (← links)
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) (Q1086843) (← links)
- A variant of Ben-Or's lower bound for algebraic decision trees (Q1096401) (← links)
- On the topology of algorithms. I (Q1099953) (← links)
- On selecting the k largest with median tests (Q1115626) (← links)
- A lower bound for the integer element distinctness problem (Q1175947) (← links)
- On the complexity of the extreme points decision problem (Q1183448) (← 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)
- Test complexity of generic polynomials (Q1201154) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- Better lower bounds on detecting affine and spherical degeneracies (Q1346125) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- Local polyhedra and geometric graphs (Q1775780) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- Rough analysis of computation trees (Q2172394) (← links)
- PAC-learning in the presence of one-sided classification~noise (Q2254605) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
- Algorithms for Black-Box Fields and their Application to Cryptography (Q3452358) (← links)
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
- On genuinely time bounded computations (Q5096139) (← links)
- Decision tree complexity and Betti numbers (Q5906824) (← links)