MIT Hardness Group
From MaRDI portal
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 |
|---|---|---|
| Easier ways to prove counting hard: a dichotomy for generalized \#SAT, applied to constraint graphs | 2026-06-08 | Paper |
| ETH lower bounds for n-queens: time waits for nobody | 2026-01-13 | Paper |
| You can't solve these Super Mario Bros. levels: undecidable Mario games Theoretical Computer Science | 2025-12-15 | Paper |
| Tetris with few piece types Theoretical Computer Science | 2025-12-05 | Paper |
Research outcomes over time
This page was built for person: MIT Hardness Group
