On the complexity of computations under varying sets of primitives
- 1 January 1975
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 110-117
- https://doi.org/10.1007/3-540-07407-4_14
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Lower bounds on the size of Boolean formulasPublished by Association for Computing Machinery (ACM) ,1975
- On some generalizations of binary searchPublished by Association for Computing Machinery (ACM) ,1974
- On the complexity of the marriage problemAdvances in Mathematics, 1972
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- Multiplikation großer ZahlenComputing, 1966
- Algebraic GeometryPublished by Walter de Gruyter GmbH ,1953