Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Measuring Empirical Computational Complexity Simon F. Goldsmith
 

Summary: Measuring Empirical Computational Complexity
Simon F. Goldsmith
Computer Science Dept.
UC Berkeley
California, USA
sfg@eecs.berkeley.edu
Alex S. Aiken
Computer Science Dept.
Stanford University
California, USA
aiken@cs.stanford.edu
Daniel S. Wilkerson
California, USA
daniel.wilkerson@gmail.com
ABSTRACT
The standard language for describing the asymptotic behavior of
algorithms is theoretical computational complexity. We propose
a method for describing the asymptotic behavior of programs in
practice by measuring their empirical computational complexity.
Our method involves running a program on workloads spanning

  

Source: Aiken, Alex - Department of Computer Science, Stanford University

 

Collections: Computer Technologies and Information Sciences