Computer Science – Logic in Computer Science
Scientist
Computer Science
Logic in Computer Science
Scientist
University of Hannover, Germany
Univ. Hannover, Germany
Leibniz Universität Hannover
A Generalized Quantifier Concept in Computational Complexity Theory
Boolean Circuits as Representation for Boolean Functions: Efficient Algorithms and Hard Problems
Complexity of Non-Monotonic Logics
Complexity Results for Modal Dependence Logic
Dependence logic with a majority quantifier
No associations
LandOfFree
Heribert Vollmer does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Heribert Vollmer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heribert Vollmer will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-126912