A condition on a class of languages is developed. This condition is such that every tally language in that class is accepted in polynomial time by a deterministic Turing machine if and only if every language accepted in exponential time by a nondeterministic machine is also accepted in exponential time by a deterministic machine
In this paper, simultaneous lower bounds on space and input head reversals for deterministic, nondet...
We define the class polyL as the set of languages that can be decided in deterministic polylogarithm...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
The following statements are shown to be equivalent:(i)Every language accepted by a nondeterministic...
A condition on a class of languages is developed. This condition is such that every tally language i...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
We study certain language classes located between P and N P that are defined by polynomial time mach...
This paper considers the well-known Turing machine model, the nondeterministic real-time Turing mach...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
This paper proves that the complexity class Ef)P, parity polynomial time [PZ83], contains the class ...
AbstractHertrampf et al. (1993) looked at complexity classes which are characterized (say accepted) ...
The P versus NP problem is to determine whether every language accepted by some nondeterministic alg...
In this paper, simultaneous lower bounds on space and input head reversals for deterministic, nondet...
We define the class polyL as the set of languages that can be decided in deterministic polylogarithm...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
The following statements are shown to be equivalent:(i)Every language accepted by a nondeterministic...
A condition on a class of languages is developed. This condition is such that every tally language i...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
We study certain language classes located between P and N P that are defined by polynomial time mach...
This paper considers the well-known Turing machine model, the nondeterministic real-time Turing mach...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
This paper proves that the complexity class Ef)P, parity polynomial time [PZ83], contains the class ...
AbstractHertrampf et al. (1993) looked at complexity classes which are characterized (say accepted) ...
The P versus NP problem is to determine whether every language accepted by some nondeterministic alg...
In this paper, simultaneous lower bounds on space and input head reversals for deterministic, nondet...
We define the class polyL as the set of languages that can be decided in deterministic polylogarithm...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
DOI
Add to ORKG