On the power of polynomial time bit-reductions

@article{Hertrampf1993OnTP,
  title={On the power of polynomial time bit-reductions},
  author={U. Hertrampf and C. Lautemann and T. Schwentick and H. Vollmer and K. Wagner},
  journal={[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference},
  year={1993},
  pages={200-207}
}
  • U. Hertrampf, C. Lautemann, +2 authors K. Wagner
  • Published 1993
  • Mathematics, Computer Science
  • [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
For a nondeterministic polynomial-time Turing machine M and an input string x, the leaf string of M on x is the 0-1-sequence of leaf-values (0 approximately reject, 1 approximately accept) of the computation tree of M with input x. The set A is said to be bit-reducible to B if there exists and M as above such that every input x is in A if and only if the leaf string of M on x is in B. A class C is definable via leaf language B, if C is the class of all languages that are bit-reducible to B. The… Expand
Complexity classes defined via k-valued functions
  • U. Hertrampf
  • Mathematics, Computer Science
  • Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
  • 1994
TLDR
A lot of complexity classes can be characterized by posing some global acceptance condition on the computation trees produced by nondeterministic polynomial time machines, and the concept of locally definable acceptance types is surveyed. Expand
Counting with Counterfree Automata
  • Christian Glaßer
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2004
TLDR
The power of balanced and unbalanced regular leaf-languages is studied, and a weak type of counting which can be done by counterfree automata is exploited, and languages of arbitrary dot- depth that are reducible to languages in dot-depth 1/2 are constructed. Expand
On balanced versus unbalanced computation trees
TLDR
It is shown that balanced trees apparently make a difference: in the unbalanced case, a class from the logarithmic-time hierarchy characterizes the corresponding class fromThe polynomial- time hierarchy with a PP-oracle, along the way of an interesting normal form for PP computations. Expand
Uniform Characterizations of Complexity Classes of Functions
TLDR
A reducibility notion between evaluation schemes leads to a necessary and sufficient criterion for relativizable inclusion between function classes, which is easily applicable and gets as a consequence, e.g., that there is an oracle A, such that min·PA⊈#·NPA (note that no structural consequences are known to follow from the corresponding positive inclusion). Expand
Logspace and Logtime Leaf Languages
TLDR
This paper indicates that it is a nontrivial problem to obtain information about the leaf string of a nonbalanced computation tree and present conditions under which it does not matter whether the computation tree is balanced or not. Expand
Functions computable in polynomial space
TLDR
It is shown that the class of functions f computable as just described is exactly the class FPSPACE of integer-valued functions computable by polynomial-space Turing machines. Expand
On Balanced vs . Unbalanced Computation Trees
A great number of complexity classes between P and PSPACE can be deened via leaf languages for computation trees of nondeterministic polynomial time machines. Jenner, McKenzie, and Th erienExpand
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes
TLDR
The first gap theorem of leaf-language definability above the Boolean closure of NP is obtained: If D = Leaf p (C) for some C REG, then D BC(NP) or there exists an oracle O such that D O 6 P NP[ log n] O for every < 1. Expand
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis
  • H. Vollmer
  • Computer Science, Mathematics
  • Theory of Computing Systems
  • 2007
TLDR
If both f and all functions in B are given by their truth-table, the problem is in quasipolynomial-size AC0, and thus cannot be hard for AC0(2) or any superclass like NC1, L, or NL. Expand
Languages polylog-time reducible to dot-depth 1/2
TLDR
Two gap theorems for balanced regular-leaf-language definable classes C and D are shown, and star-free regular languages L"n are constructed such that L"N's balanced leaf-language class is NP, but the unbalanced leaf- language class of L'n contains level n of the unambiguous alternation hierarchy. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Locally Definable Acceptance Types - The Three-Valued Case
TLDR
If all the functions appearing in nondeterministic nodes of some computation tree are from some set of functions F, then F is called an m-valued locally definable acceptance type, and the class of languages recognizable by such machines with acceptance type F is denoted by (F)P. Expand
Locally Definable Acceptance Types for Polynomial Time Machines
TLDR
M-valued locally definable acceptance types are introduced, a new model generalizing the idea of alternating machines and their acceptance behaviour, by proving a normal form theorem stating that for every finite acceptancetype there exists a finite acceptance type that characterizes the same class, but consists only of one binary function. Expand
The Hardest Context-Free Language
  • S. Greibach
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1973
TLDR
The time complexity of recognition of L_0, a context-free language, is the least upper bound for time complexity in terms of deterministic polynomial time acceptable languages. Expand
On the Tape Complexity of Deterministic Context-Free Languages
TLDR
A tape hardest deterministic context-free language is described and the best upper bound known on the tape complexity of (deterministic) context- free languages is (log(n) 2). Expand
Counting Classes: Thresholds, Parity, Mods, and Fewness
TLDR
Every counting class consists of languages in P#P, the class of languages computable in polynomial time using a single call to an oracle capable of determining the number of accepting paths of an NP machine. Expand
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
TLDR
The method of proof is extended to investigate the complexity of the word problem for a fixed permutation group and show that polynomial size circuits of width 4 also recognize exactly nonuniform NC 1. Expand
Complexity Classes and Sparse Oracles
Complexity classes are usually defined by referring to computation models and by putting suitable restrictions on them. Following this approach, many proofs of results are tightly bound to theExpand
A complexity theory based on Boolean algebra
  • Sven Skyum, L. Valiant
  • Mathematics, Computer Science
  • 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
  • 1981
TLDR
It is shown that much of what is of everyday relevance in Turing-machine-based complexity theory can be replicated easily and naturally in this elementary framework. Expand
Succinct Representations of Graphs
TLDR
The main result is characterizing a large class of graph properties for which the respective “succinct problem” is NP-hard, and shows that the succinct versions of polynomially equivalent problems may not be polynomial equivalent. Expand
A Simulation Result for the Auxiliary Pushdown Automata
  • T. Harju
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • 1979
TLDR
S(n)-tape bounded nondeterministic Turing machines can be simulated by S(n) bounded deterministic automata which have an auxiliary pushdown storage of length S2(n). Expand
...
1
2
...