The following pages link to Heribert Vollmer (Q208765):
Displaying 50 items.
- Parameterized Complexity of Weighted Satisfiability Problems (Q2843338) (← links)
- Regular cost functions. I: Logic and algebra over words (Q2846575) (← links)
- Extended Modal Dependence Logic $\mathcal{EMDL}$ (Q2849427) (← links)
- Model Checking for Modal Dependence Logic: An Approach through Post’s Lattice (Q2849435) (← links)
- Paradigms for Parameterized Enumeration (Q2849918) (← links)
- A fragment of dependence logic capturing polynomial time (Q2878749) (← links)
- On the Parameterized Complexity of Default Logic and Autoepistemic Logic (Q2890211) (← links)
- The complexity of reasoning for fragments of default logic (Q2893324) (← links)
- Multiparty communication complexity and threshold circuit size of AC\(^0\) (Q2910850) (← links)
- Dependence logic with a majority quantifier (Q2911629) (← links)
- Complexity of Propositional Independence and Inclusion Logic (Q2946342) (← links)
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
- The tractability of model checking for LTL (Q2946630) (← links)
- LoCo—A Logic for Configuration Problems (Q2946729) (← links)
- Modal independence logic: (Q3133166) (← links)
- Complexity classifications for different equivalence and audit problems for Boolean circuits (Q3166221) (← links)
- (Q3457200) (← links)
- On Second-Order Monadic Groupoidal Quantifiers (Q3511462) (← links)
- Complexity Results for Modal Dependence Logic (Q3586056) (← links)
- The Complexity of Generalized Satisfiability for Linear Temporal Logic (Q3623013) (← links)
- (Q4251062) (← links)
- Complements of multivalued functions (Q4259998) (← links)
- (Q4281699) (← links)
- THE COMPLEXITY OF FINDING MIDDLE ELEMENTS (Q4291544) (← links)
- (Q4336277) (← links)
- (Q4381403) (← links)
- (Q4393484) (← links)
- (Q4411838) (← links)
- Generic separations and leaf languages (Q4419264) (← links)
- On the Autoreducibility of Random Sequences (Q4441893) (← links)
- (Q4452054) (← links)
- (Q4472442) (← links)
- UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
- (Q4536369) (← links)
- (Q4536400) (← links)
- (Q4584892) (← links)
- Complexity of Propositional Logics in Team Semantic (Q4608724) (← links)
- (Q4636302) (← links)
- Arithmetic Circuits and Polynomial Replacement Systems (Q4651522) (← links)
- (Q4737911) (← links)
- (Q4783318) (← links)
- (Q4818850) (← links)
- On balanced versus unbalanced computation trees (Q4887490) (← links)
- (Q4938648) (← links)
- (Q4942628) (← links)
- (Q4955353) (← links)
- Satisfiability of Modal Inclusion Logic (Q4972171) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth (Q5145309) (← links)
- Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
