A Renee Equation for Algorithmic Complexity

Authors:
Keye Martin
Affiliations:
-
Venue:
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Year:
2001

Citing 5
Cited 2

Domain theory

Handbook of logic in computer science (vol. 3)
Computability and complexity: from a programming perspective

Computability and complexity: from a programming perspective
The Measurement Process in Domain Theory

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Principle of Induction

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A foundation for computation

A foundation for computation

The Informatic Derivative at a Compact Element

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Ideal models of spaces

Theoretical Computer Science - Topology in computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a notion of complexity for the renee equation and use it to develop a method for analyzing search algorithms which enables a uniform treatment of techniques that manipulate discrete data, like linear and binary search of lists, as well as those which manipulate continuous data, like methods for zero finding in numerical analysis.