( en | de | ru )

 

Disambiguation of "Vollmer, Heribert"

Author of the publication

copydeleteadd this publication to your clipboard
Counting Classes and the Fine Structure between NC1 and L.

, , , , and . Electron. Colloquium Comput. Complex., (2010)

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. You can also use the button next to the name to display some publications already assigned to the person.

Heribert Vollmer

Heribert Vollmer

Siegfried Vollmer

Hilde Vollmer

Gregor Vollmer

 

Other publications of authors with the same name

Complexity Theory Made Easy.. Developments in Language Theory, volume 2710 of Lecture Notes in Computer Science, page 95-110. Springer, (2003)A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits., and . WoLLIC, volume 9803 of Lecture Notes in Computer Science, page 234-248. Springer, (2016)On the Autoreducibility of Random Sequences., and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 333-342. Springer, (2000)Generic separations and leaf languages., , and . Math. Log. Q., 49 (4): 353-362 (2003)A Logical Characterization of Constant-Depth Circuits over the Reals., and . CoRR, (2020)Finite Automata with Generalized Acceptance Criteria., and . Discret. Math. Theor. Comput. Sci., 4 (2): 179-192 (2001)Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics., , , and . ACM Trans. Comput. Log., 21 (1): 7:1-7:18 (2020)A model-theoretic characterization of constant-depth arithmetic circuits., and . Ann. Pure Appl. Log., 170 (9): 1008-1029 (2019)On the Autoreducibility of Random Sequences., and . Technical Report, 239. Department of Computer Science, (October 1999)Arithmetic Circuits and Polynomial Replacement Systems., , and . Technical Report, 242. Department of Computer Science, (November 1999)