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 |
|---|---|---|
| Parity is positively useless | 2017-03-22 | Paper |
| On the NP-hardness of approximating ordering-constraint satisfaction problems Theory of Computing | 2015-08-21 | Paper |
| Circumventing \(d\)-to-\(1\) for approximation resistance of satisfiable predicates strictly containing parity of width at least four Theory of Computing | 2014-10-06 | Paper |
| Complexity of Canadian traveler problem variants Theoretical Computer Science | 2013-12-11 | Paper |
| On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
| Circumventing \(d\)-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width four (extended abstract) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Research outcomes over time
This page was built for person: Cenny Wenner
