Pages that link to "Item:Q1259164"
From MaRDI portal
The following pages link to On the complexity of computations under varying sets of primitives (Q1259164):
Displaying 28 items.
- On topological lower bounds for algebraic computation trees (Q525599) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model (Q1050255) (← links)
- Lower bounds on probabilistic linear decision trees (Q1067786) (← links)
- Some dynamic computational geometry problems (Q1071526) (← links)
- Legal coloring of graphs (Q1079578) (← links)
- Geometric complexity of some location problems (Q1099951) (← links)
- Lower bound arguments with ``inaccessible'' numbers (Q1107308) (← links)
- Establishing order in planar subdivisions (Q1115185) (← links)
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← links)
- Linear decision trees are too weak for convex hull problem (Q1155366) (← links)
- Finding connected components of an intersection graph of squares in the Euclidean plane (Q1169296) (← links)
- Comparisons between linear functions can help (Q1170029) (← links)
- A note on a \(P \neq NP\) result for a restricted class of real machines (Q1203647) (← links)
- Lower bounds for sorting of sums (Q1262763) (← links)
- Worst-case versus average case complexity of ray-shooting (Q1271535) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- Bounds for the Element Distinctness Problem on one-tape Turing machines (Q1603524) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- Rough analysis of computation trees (Q2172394) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- An optimal algorithm for the minimum disc cover problem (Q2471803) (← links)
- Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
