Hostname: page-component-669899f699-7xsfk Total loading time: 0 Render date: 2025-04-27T06:35:44.633Z Has data issue: false hasContentIssue false
  • English
  • Français

Time polynomial in input or output

Published online by Cambridge University Press:  12 March 2014

Yuri Gurevich  and
Saharon Shelah
Yuri Gurevich
Affiliation:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109 Institute of Mathematics, The Hebrew University, Jerusalem, Israel
Saharon Shelah
Affiliation:
Department of Mathematics, Rutgers University, New Brunswick, New Jersey 08903
Get access Rights & Permissions [Opens in a new window]

Abstract

We introduce the class PIO of functions computable in time that is polynomial in max {the length of input, the length of output}, observe that there is no notation system for total PIO functions but there are notation systems for partial PIO functions, and give an algebra of partial PIO functions from binary strings to binary strings.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 54 , Issue 3 , September 1989 , pp. 1083 - 1088
Copyright
Copyright © Association for Symbolic Logic 1989

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[CP]Cai, Jiazhen and Paige, Robert, Binding performance at language design time, Conference record of the fourteenth annual ACM symposium on principles of programming languages, 1987, pp. 80–87.Google Scholar
[GS]Gurevich, Yuri and Shelah, Saharon, Nearly linear time, Lecture Notes in Computer Science, Springer-Verlag (to appear).CrossRefGoogle Scholar
[Pa]Paige, Robert, Private communication, Fall 1985.Google Scholar