Scholar
Markus Hecher
Google Scholar ID: g5WUgFoAAAAJ
CNRS, Artois University (CRIL)
logic
computational complexity
fixed parameter tractability
answer set programming
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,028
H-index
19
i10-index
33
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
8 items
From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting
2025
Cited
0
Structure-Aware Encodings of Argumentation Properties for Clique-width
2025
Cited
0
Automated Hybrid Grounding Using Structural and Data-Driven Heuristics
2025
Cited
0
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
2025
Cited
0
Facets in Argumentation: A Formal Approach to Argument Significance
2025
Cited
0
Counting and Reasoning with Plans
2025
Cited
0
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
arXiv.org · 2024
Cited
0
Structure-Guided Automated Reasoning
arXiv.org · 2023
Cited
0
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up