Daniel Grier

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
A quantum query complexity trichotomy for regular languages	2025-08-12	Paper
The complexity of poset games Journal of Graph Algorithms and Applications	2022-06-28	Paper
Classical algorithms for Forrelation	2021-02-13	Paper
Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
scientific article; zbMATH DE number 7250159 (Why is no real title available?) (available as arXiv preprint)	2020-09-22	Paper
The classification of reversible bit operations (available as arXiv preprint)	2018-05-03	Paper
On the complexity of probabilistic trials for hidden satisfiability problems (available as arXiv preprint)	2018-03-21	Paper
Game values and computational complexity: an analysis via black-white combinatorial games Algorithms and Computation	2016-01-11	Paper
Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete Automata, Languages, and Programming	2013-08-06	Paper
On the cyclic van der Waerden numbers	2013-02-28	Paper

Research outcomes over time

This page was built for person: Daniel Grier