Searching for authors named "Carsten Damm" – sorted by Relevance.
-
Automata That Take Advice
- Automata That Take Advice Carsten Damm 1 and Markus Holzer 2;3 1 FB IV-Informatik, Universitat
- Cited by 2 (1 self) – Add To MetaCart
-
Inductive Counting below LOGSPACE
- Inductive Counting Below LOGSPACE ? Carsten Damm 1 and Markus Holzer 2 1 FB IV
- Cited by 3 (3 self) – Add To MetaCart
-
A note on Spectral Lower Bound Arguments for Decision Trees
- Arguments for Decision Trees Carsten Damm A note on Spectral Lower Bound Arguments for Decision Trees
- Add To MetaCart
-
How much ExOR improves on OR?
- much ExOR improves on OR ? Carsten Damm How much ExOR improves on OR ? Carsten Damm y Abstract
- Add To MetaCart
-
The Complexity of Tensor Calculus
- The Complexity of Tensor Calculus Carsten Damm Institut fur Angewandte und Numerische
- Cited by 3 (2 self) – Add To MetaCart
-
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers
- Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers Carsten Damm y
- Cited by 2 (1 self) – Add To MetaCart
-
Structure and Importance of Logspace-MOD-Classes
- Structure and Importance of Logspace-MOD-Classes Gerhard Buntrock y Carsten Damm z Ulrich
- Cited by 32 (1 self) – Add To MetaCart
-
Some Bounds on Multiparty Communication Complexity of Pointer Jumping
- @(email omitted); with subject 'help eccc' Some Bounds on Multiparty Communication Complexity of Pointer Jumping Carsten Damm
- Cited by 10 (1 self) – Add To MetaCart
-
Symmetric Functions in AC 0 [2]
- -05 Symmetric Functions in AC 0 [2] Carsten Damm Katja Lenz Symmetric Functions in AC 0 [2] Carsten Damm
- Add To MetaCart
-
On the Complexity of Tensor Formulae
- On the Complexity of Tensor Formulae Carsten Damm y Abstract We consider formulae on base
- Add To MetaCart

