Time polynomial in input or output

Journal of Symbolic Logic 54 (3):1083-1088 (1989)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274767
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,133
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
5 ( #610,230 of 2,191,821 )

Recent downloads (6 months)
1 ( #288,547 of 2,191,821 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature