Multi-head finite automata: data-independent versus data-dependent computations
Theoretical Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The complexity of tensor calculus
Computational Complexity
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Theoretical Computer Science - Mathematical foundations of computer science 2000
Theoretical Computer Science
Hi-index | 0.00 |