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 |
|---|---|---|
| Hardness and fixed parameter tractability for pinwheel scheduling problems Theoretical Computer Science | 2026-06-15 | Paper |
| Tensor rank is hard to approximate | 2021-08-04 | Paper |
| \(d\)-Galvin families The Electronic Journal of Combinatorics | 2020-02-10 | Paper |
| \(d\)-Galvin families The Electronic Journal of Combinatorics | 2020-02-10 | Paper |
| On the complexity of intersecting regular, context-free, and tree languages Automata, Languages, and Programming | 2015-11-04 | Paper |
Research outcomes over time
This page was built for person: Joseph Swernofsky
