Program Size Complexity for Possibly Infinite Computations
Login
University Home
→
Library
JavaScript is disabled for your browser. Some features of this site may not work without it.
Program Size Complexity for Possibly Infinite Computations
Becher, V
;
Figueira, S
;
Nies, A
;
Picchi, S
Identifier:
http://hdl.handle.net/2292/3729
Issue Date:
2003-08
Reference:
CDMTCS Research Reports CDMTCS-222 (2003)
Rights:
The author(s)
Rights (URI):
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
Abstract:
[no abstract available]
Show full item record
Files in this item
Name:
222andre.pdf
Size:
208.6Kb
Format:
PDF
Related URL:
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial
This item appears in the following Collection(s)
CDMTCS Research Reports (1995+)
[574]
Share
Search ResearchSpace
Search ResearchSpace
This Collection
Browse
All of ResearchSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Statistics
View Usage Statistics