( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Deterministic OL Languages are of Very Low Complexity: DOL is in AC0.

, , , и . Developments in Language Theory, стр. 305-313. World Scientific, Singapore, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Carsten Damm

Carsten Damm

Carsten Damm

Winfried Damm

Marianne Damm

 

Другие публикации лиц с тем же именем

Complexity of some arithmetic problems for binary polynomials., , , , , и . Comput. Complex., 12 (1-2): 23-47 (2003)On Alternating vs. Parity Communication Complexity. Universität Trier, Mathematik/Informatik, Forschungsbericht, (1998)Symmetric Functions in AC02, и . Universität Trier, Mathematik/Informatik, Forschungsbericht, (1993)A Note on Spectral Lower Bound Arguments for Decision Trees.. Bulletin of the EATCS, (1998)Some Bounds on Multiparty Communication Complexity of Pointer Jumping, , и . Electron. Colloquium Comput. Complex., (1995)On Covering and Rank Problems for Boolean Matrices and Their Applications., , и . COCOON, том 1627 из Lecture Notes in Computer Science, стр. 123-133. Springer, (1999)Some Bounds on Multiparty Communication Complexity of Pointer Jumping., , и . STACS, том 1046 из Lecture Notes in Computer Science, стр. 643-654. Springer, (1996)The Complexity of Symmetric Functions in Parity Normal Forms.. MFCS, том 452 из Lecture Notes in Computer Science, стр. 232-238. Springer, (1990)On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols.. MFCS, том 1450 из Lecture Notes in Computer Science, стр. 780-788. Springer, (1998)The average sensitivity of square-freeness., , и . Comput. Complex., 9 (1): 39-51 (2000)