Pages that link to "Item:Q3978174"
From MaRDI portal
The following pages link to Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains (Q3978174):
Displaying 40 items.
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- A note on testing axioms of revealed preference (Q495751) (← links)
- On topological lower bounds for algebraic computation trees (Q525599) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Connectivity of discrete planes (Q596053) (← links)
- Algebraic decision trees and Euler characteristics (Q673780) (← links)
- Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715) (← links)
- On the algebraic complexity of set equality and inclusion (Q834932) (← links)
- Matching points with rectangles and squares (Q955221) (← links)
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree (Q1026238) (← links)
- A lower bound for the integer element distinctness problem (Q1175947) (← links)
- An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095) (← links)
- A comment on a minmax location problem (Q1306472) (← links)
- Sorting helps for Voronoi diagrams (Q1355725) (← links)
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- Easy lower bound for a strange computational model (Q1377572) (← links)
- Structural tolerance and Delaunay triangulation (Q1606996) (← links)
- Simulating probabilistic by deterministic algebraic computation trees (Q1821560) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- The inverse Voronoi problem in graphs. II: Trees (Q2663704) (← links)
- Lower bounds on testing membership to a polyhedron by algebraic decision trees (Q2817657) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
- A new method for proving lower bounds in the model of algebraic decision trees (Q3979281) (← links)
- Lower bounds for linear satisfiability problems (Q4267801) (← links)
- Lower bounds on algebraic random access machines (Q4645192) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS (Q4682161) (← links)
- A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma (Q4993326) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- Lower bounds for the matrix chain ordering problem (Q5096328) (← links)
- (Q5111256) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)
