Thomas Watson
From MaRDI portal
Person:6544090
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 |
|---|---|---|
| 6-uniform maker-breaker game is PSPACE-complete | 2026-04-21 | Paper |
| Nondeterministic and randomized Boolean hierarchies in communication complexity | 2026-03-18 | Paper |
| Tractable unordered 3-CNF games Computational Complexity | 2025-10-24 | Paper |
| Query-to-communication lifting for BPP | 2025-08-06 | Paper |
| Extension complexity of independent set polytopes | 2025-08-06 | Paper |
| Deterministic communication vs. partition number | 2025-08-05 | Paper |
| Complexity of fault tolerant query complexity | 2024-09-12 | Paper |
| Erdős-Selfridge theorem for nonmonotone CNFs | 2024-05-27 | Paper |
Research outcomes over time
This page was built for person: Thomas Watson
