Strong reducibilities such as the m-reducibility have been around implicitly, if not explicitly, since the dawn of computability theory. The explicit recognition of the existence of differing kinds of oracle access mechanisms began with the seminal work of Post [12]. Of interest to us from Post’s paper are the so-called tabular reducibilities ≤tt, truth table reducibility, an
Abstract. We investigate the connections between the complexity of a c.e. set, as calibrated by its ...
Following Trakhtenbrot's concept of autoreducible set, we look at the general phenomenon of autocomp...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
AbstractVarious polynomial-time truth-table reducibilities are compared by their ability of using sp...
AbstractWe show that polynomial time truth-table reducibility via Boolean circuits to SAT is the sam...
We present a constructive analysis and machine-checked synthetic approach to the theory of one-one, ...
International audienceWe present a constructive analysis and machine-checked theory of one-one, many...
For various polynomial-time reducibilities r , this paper asks whether being r-reducible to a spars...
The need of formalizing a satisfactory notion of relative computability of partial functions leads ...
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as lo...
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, trut...
Abstract. We investigate the truth-table degrees of (co-)c.e. sets, in partic-ular, sets of random s...
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular,sets of random strings. It ...
AbstractBailey, C. and R. Downey, Tabular degrees in \Ga-recursion theory, Annals of Pure and Applie...
AbstractVarious forms of polynomial time reducibility are compared. Among the forms examined are man...
Abstract. We investigate the connections between the complexity of a c.e. set, as calibrated by its ...
Following Trakhtenbrot's concept of autoreducible set, we look at the general phenomenon of autocomp...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
AbstractVarious polynomial-time truth-table reducibilities are compared by their ability of using sp...
AbstractWe show that polynomial time truth-table reducibility via Boolean circuits to SAT is the sam...
We present a constructive analysis and machine-checked synthetic approach to the theory of one-one, ...
International audienceWe present a constructive analysis and machine-checked theory of one-one, many...
For various polynomial-time reducibilities r , this paper asks whether being r-reducible to a spars...
The need of formalizing a satisfactory notion of relative computability of partial functions leads ...
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as lo...
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, trut...
Abstract. We investigate the truth-table degrees of (co-)c.e. sets, in partic-ular, sets of random s...
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular,sets of random strings. It ...
AbstractBailey, C. and R. Downey, Tabular degrees in \Ga-recursion theory, Annals of Pure and Applie...
AbstractVarious forms of polynomial time reducibility are compared. Among the forms examined are man...
Abstract. We investigate the connections between the complexity of a c.e. set, as calibrated by its ...
Following Trakhtenbrot's concept of autoreducible set, we look at the general phenomenon of autocomp...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
DOI
Add to ORKG