Joshua A. Grochow
Orcid: 0000-0002-6466-0476Affiliations:
- University of Colorado at Boulder, Department of Computer Science, CO, USA
According to our database1,
Joshua A. Grochow
authored at least 50 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on twitter.com
-
on orcid.org
On csauthors.net:
Bibliography
2024
On <i>p</i>-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors.
ACM Trans. Comput. Theory, March, 2024
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
2023
Theory Comput. Syst., June, 2023
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness.
SIAM J. Comput., April, 2023
Is stochastic thermodynamics the key to understanding the energy costs of computation?
CoRR, 2023
On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract).
Proceedings of the Fourteenth International Symposium on Games, 2023
On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications.
CoRR, 2023
Polynomial Identity Testing and the Ideal Proof System: PIT is in NP if and only if IPS can be p-simulated by a Cook-Reckhow proof system.
CoRR, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023
Proceedings of the 38th Computational Complexity Conference, 2023
2022
Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022
2021
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors.
Proceedings of the 36th Computational Complexity Conference, 2021
2020
Complexity in Ideals of Polynomials: Questions on Algebraic Complexity of Circuits and Proofs.
Bull. EATCS, 2020
2019
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions.
CoRR, 2019
2018
Beyond Number of Bit Erasures: New Complexity Questions Raised by Recently Discovered Thermodynamic Costs of Computation.
SIGACT News, 2018
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System.
J. ACM, 2018
Proceedings of the 34th International Symposium on Computational Geometry, 2018
2017
Theory Comput., 2017
Entropy, 2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
CoRR, 2017
2016
NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications.
Electron. Colloquium Comput. Complex., 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition.
CoRR, 2015
Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract).
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
2014
Electron. Colloquium Comput. Complex., 2014
A framework for optimal high-level descriptions in science and engineering - preliminary report.
CoRR, 2014
2013
Electron. Colloquium Comput. Complex., 2013
CoRR, 2013
2012
Proceedings of the 27th Conference on Computational Complexity, 2012
2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2007
Proceedings of the Research in Computational Molecular Biology, 2007