Search Results - "complexity classes of functions"

Provably total functions of intuitionistic bounded arithmetic

Authors: Victor Harnik

Source: Journal of Symbolic Logic. 57:466-477

Subject Terms: computability, First-order arithmetic and fragments, 0102 computer and information sciences, 0101 mathematics, complexity classes of functions in fragments of intuitionistic bounded arithmetic, 16. Peace & justice, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/149989
https://doi.org/10.2307/2275282
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/provably-total-functions-of-intuitionistic-bounded-arithmetic/AB26BC8DD218B2B422F998D9D2D3285D
https://dblp.uni-trier.de/db/journals/jsyml/jsyml57.html#Harnik92
https://www.jstor.org/stable/2275282
https://projecteuclid.org/euclid.jsl/1183743967

Complexity Classes for Partial Functions: Complexity classes for partial functions

Authors: Selman, Alan L.

Source: Current Trends in Theoretical Computer Science ISBN: 9789810214623

Subject Terms: complexity classes of sets, nondeterministic algorithms, Complexity classes (hierarchies, relations among complexity classes, etc.), complexity classes of functions, multivalued functions

File Description: application/xml

Access URL: https://zbmath.org/58287

The Complexity Of Finding Middle Elements

Authors: Heribert Vollmer Klaus W. Wagner The Pennsylvania State University CiteSeerX Archives

Contributors: Heribert Vollmer Klaus W. Wagner The Pennsylvania State University CiteSeerX Archives

Source: ftp://haegar.informatik.uni-wuerzburg.de/pub/TRs/vo-wa93a.ps.gz

Subject Terms: complexity theory, nondeterministic polynomial time Turing machine, counting classes, complexity classes of functions, median classes, complexity theoretic operators

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.59

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.59