Topological lower bounds on algebraic random access machines

SIAM Journal on Computing

Volumn 31, Issue 3, 2002, Pages 722-761

  Ben Amram, Amir M ^a   Galil, Zvi ^a  

^a 450 Computer Science Building ^*  (United States)

Author keywords

Algebraic computation trees; Component counting arguments; Element distinctness; Knapsack

Indexed keywords

COMPUTATION THEORY; SET THEORY; THEOREM PROVING; TOPOLOGY; TREES (MATHEMATICS);

COMPUTATION TREES;

RANDOM ACCESS STORAGE;

EID: 0036302003     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797329397     Document Type: Article

References (20)

1. Lower bounds on algebraic computation trees
2. Lower bounds for the complexity of functions in a realistic RAM model
3. Fast exponentiation with the floor operation
4. Lower bounds for sorting with realistic instruction sets
5. 2 on linear search programs for the knapsack problem
6. On computations with integer division
7. A lower time bound for the knapsack problem on random access machines
8. Capabilities and complexity of computations with integer division
9. Lower bounds for computations with the floor operation
10. A lower bound for integer greatest common divisor computations
11. Lower bounds for solving linear diophantine equations on random access machines
12. On genuinely time bounded computations
13. On the Betti numbers of real varieties
14. Decision trees and random access machines
15. Lower bounds for algebraic decision trees
16. Sur l'homologie des variétés algébriques réelles
17. Lower bounds for algebraic computation trees with integer inputs
18. Decision tree complexity and Betti numbers