Anja Remshagen
From MaRDI portal
Person:812438
Available identifiers
zbMath Open remshagen.anjaMaRDI QIDQ812438
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| Counting Magic Venn Diagrams | 2025-01-08 | Paper |
| An upper bound for the circuit complexity of existentially quantified Boolean formulas | 2010-07-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| An effective algorithm for the futile questioning problem | 2006-01-23 | Paper |
| Learning in a compiler for MINSAT algorithms | 2004-03-01 | Paper |
Research outcomes over time
This page was built for person: Anja Remshagen
