Searching for "Complexity Classes for Partial Functions." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

On Using Oracles That Compute Values
by Stephen Fenner, Steve Homer, Mitsunori Ogiwara, Alan L. Selman — 1993 — In Proc. 10th Annual Symp. on Theoret. Aspects of Computer Science, Lecture Notes in Computer Science
… the complexity of G. Let PF denote the class of partial functions that are computable deterministically…
Cited by 16 (5 self) – Add To MetaCart

Oracles That Compute Values
by Stephen Fenner, Steven Homer, Mitsunori Ogihara, Alan Selman — 1997
… , AND ALAN SELMAN x Abstract. This paper focuses on complexity classes of partial functions…
Cited by 11 (4 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB