The following pages link to Miki Hermann (Q235689):
Displaying 46 items.
- (Q679541) (redirect page) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- Complexity of counting the optimal solutions (Q837174) (← links)
- Chain properties of rule closures (Q916402) (← links)
- On Boolean primitive positive clones (Q932583) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- Counting complexity of propositional abduction (Q988576) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- The complexity of counting problems in equational matching (Q1914166) (← links)
- Complexity of generalized satisfiability counting problems (Q1917076) (← links)
- MCP: capturing big data by satisfiability (tool description) (Q2118299) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- Complexity of clausal constraints over chains (Q2480746) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- As Close as It Gets (Q2803825) (← links)
- Complexity of existential positive first-order logic (Q2843995) (← links)
- Give Me Another One! (Q3459903) (← links)
- Complexity of Counting the Optimal Solutions (Q3511323) (← links)
- Counting Complexity of Minimal Cardinality and Minimal Weight Abduction (Q3532468) (← links)
- On the Computational Complexity of Monotone Constraint Satisfaction Problems (Q3605505) (← links)
- Efficient Algorithms for Description Problems over Finite Totally Ordered Domains (Q3631897) (← links)
- (Q3725541) (← links)
- (Q4246728) (← links)
- (Q4418672) (← links)
- (Q4536368) (← links)
- Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
- Counting Partitions of Graphs (Q4909540) (← links)
- (Q4938414) (← links)
- (Q4941892) (← links)
- On proving properties of completion strategies (Q5055777) (← links)
- Chain properties of rule closures (Q5096168) (← links)
- The complexity of counting problems in equational matching (Q5210797) (← links)
- Automated Reasoning (Q5307063) (← links)
- Complexity of Default Logic on Generalized Conjunctive Queries (Q5425398) (← links)
- On the Complexity of Computing Generators of Closed Sets (Q5445331) (← links)
- Theory and Applications of Satisfiability Testing (Q5714771) (← links)
- The Next Whisky Bar (Q5740176) (← links)
- Meta-rule synthesis from crossed rewrite systems (Q5881274) (← links)
- Computational complexity of simultaneous elementary matching problems (Q5900977) (← links)
- Computational complexity of simultaneous elementary matching problems (Q5916324) (← links)
- On the complexity of recognizing the Hilbert basis of a linear Diophantine system (Q5958323) (← links)
- (Q6159912) (← links)
- Riemannian optimisation methods for ground states of multicomponent Bose-Einstein condensates (Q6753504) (← links)
