On balanced versus unbalanced computation trees
From MaRDI portal
Publication:4887490
DOI10.1007/BF01192696zbMATH Open0853.68097MaRDI QIDQ4887490FDOQ4887490
Authors: Ulrich Hertrampf, Heribert Vollmer, K. W. Wagner 
Publication date: 5 August 1996
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A uniform approach to define complexity classes
- Alternation
- Logspace and logtime leaf languages
- Complexity classes and sparse oracles
- Title not available (Why is that?)
- Computational Complexity of Probabilistic Turing Machines
- Complete sets and the polynomial-time hierarchy
- Title not available (Why is that?)
Cited In (17)
- SELF-SPECIFYING MACHINES
- Relations among parallel and sequential computation models
- Leaf languages and string compression
- Dot operators
- A characterization of the leaf language classes
- Nondeterministic \(NC^1\) computation
- Balancing Bounded Treewidth Circuits
- Fine hierarchies and m-reducibilities in theoretical computer science
- Succinct representation, leaf languages, and projection reductions
- Balancing bounded treewidth circuits
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
- Lindström quantifiers and leaf language definability
- A reducibility for the dot-depth hierarchy
- Title not available (Why is that?)
- Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria
- Very Sparse Leaf Languages
- Transforming unbalanced multiway trees into a practical external data structure
This page was built for publication: On balanced versus unbalanced computation trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887490)
