Automated Higher-Order Complexity Analysis

by Ralph Benzinger
2000-2001

My non-technical presentation will highlight how we can
- express the complexity of higher-order terms,
- automate complexity analysis, and - create and solve higher-order recurrence equations
and will include a live demonstration of my ACA System vs. The Pigeon Holes.

PRL Home
Introduction
The Nuprl book
Origins of the PRL Project
Goals
Dynamics of the Project
Mathematical Expression in Nuprl
Cross Links to Math & CS Fields

Knowledge Base
Math Library
Publications
Projects
CRASH
Nuprl/FDL System
EventML Software
Seminar

People
Wiki
The Book
Lectures
Other Groups

Automated Higher-Order Complexity Analysis

by Ralph Benzinger 2000-2001

by Ralph Benzinger
2000-2001