DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Enumeration reducibility
Enumeration reducibility
Relationships Between Computability-Theoretic Properties of Problems
Co~Nparison of Polynomial- Time Reducibilities Richard Ladner University of Washington Seattle, Wash. Nanay Lynch University Of
{\Alpha} Degrees As an Automorphism Base for the {\Alpha}-Enumeration
Symmetric Enumeration Reducibility
Enumeration Order Equivalency
On Sets Polynomially Enumerable by Iteration*
Some Results on Enumeration Reductibility
Introduction to Enumeration Reducibility
Symmetric Enumeration Reducibility
Enumeration Degrees
A. Definitions of Reductions and Complexity Classes, and Notation List
Enumeration Reducibility and Computable Structure Theory
GENERIC COMPUTABILITY, TURING DEGREES, and ASYMPTOTIC DENSITY 1. Introduction in Recent Years There Has Been a General Realizati
Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra Emmanuel Jeandel
A Note on Initial Segments of the Enumeration Degrees
The Turing Universe in the Context of Enumeration Reducibility
DEFINING TOTALITY in the ENUMERATION DEGREES Two Of
Enumeration in Algebra Emmanuel Jeandel
Top View
Enumeration Reducibility with Polynomial Time Bounds
Enumeration Reducibility and Polynomial Time Bounds
Relationships Between Computability-Theoretic Properties of Problems