On balanced versus unbalanced computation trees
From MaRDI portal
Publication:4887490
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 1354134 (Why is no real title available?)
- A uniform approach to define complexity classes
- Alternation
- Complete sets and the polynomial-time hierarchy
- Complexity classes and sparse oracles
- Computational Complexity of Probabilistic Turing Machines
- Logspace and logtime leaf languages
Cited in
(17)- SELF-SPECIFYING MACHINES
- Leaf languages and string compression
- A characterization of the leaf language classes
- Transforming unbalanced multiway trees into a practical external data structure
- Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria
- A reducibility for the dot-depth hierarchy
- Balancing Bounded Treewidth Circuits
- Succinct representation, leaf languages, and projection reductions
- Balancing bounded treewidth circuits
- Nondeterministic \(NC^1\) computation
- Dot operators
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
- Very Sparse Leaf Languages
- Relations among parallel and sequential computation models
- Fine hierarchies and m-reducibilities in theoretical computer science
- Lindström quantifiers and leaf language definability
- scientific article; zbMATH DE number 7561757 (Why is no real title available?)
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)
