Youming Qiao

SIAM J. Comput., 2021

On the Baer-Lovász-Tutte construction of groups from graphs: Isomorphism types and homomorphism notions.

[BibT_eX]

[DOI]

Xiaoyu He

Eur. J. Comb., 2021

Enumerating alternating matrix spaces over finite fields with explicit coordinates.

[BibT_eX]

[DOI]

Discret. Math., 2021

The isomorphism problem for plain groups is in Σ3P.

[BibT_eX]

[DOI]

CoRR, 2021

Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms.

[BibT_eX]

[DOI]

Gang Tang

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.

[BibT_eX]

[DOI]

Proceedings of the 36th Computational Complexity Conference, 2021

2020

Local Equivalence of Multipartite Entanglement.

[BibT_eX]

[DOI]

Nengkun Yu

IEEE J. Sel. Areas Commun., 2020

Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions.

[BibT_eX]

[DOI]

CoRR, 2019

Incorporating Weisfeiler-Leman into algorithms for group isomorphism.

[BibT_eX]

[DOI]

CoRR, 2019

From independent sets and vertex colorings to isotropic spaces and isotropic decompositions.

[BibT_eX]

[DOI]

CoRR, 2019

2018

On the complexity of trial and error for constraint satisfaction problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Constructive non-commutative rank computation is in deterministic polynomial time.

[BibT_eX]

[DOI]

Comput. Complex., 2018

2017

Sparse multivariate polynomial interpolation on the basis of Schubert polynomials.

[BibT_eX]

[DOI]

Priyanka Mukhopadhyay

Comput. Complex., 2017

Non-commutative Edmonds' problem and matrix semi-invariants.

[BibT_eX]

[DOI]

Comput. Complex., 2017

Networked Fairness in Cake Cutting.

[BibT_eX]

[DOI]

Xiaohui Bei

Shengyu Zhang

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model.

[BibT_eX]

[DOI]

Yinan Li

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz.

[BibT_eX]

[DOI]

Proceedings of the 32nd Computational Complexity Conference, 2017

2016

Boundaries of VP and VNP.

[BibT_eX]

[DOI]

Ketan D. Mulmuley

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Any monotone property of 3-uniform hypergraphs is weakly evasive.

[BibT_eX]

[DOI]

Raghav Kulkarni

Theor. Comput. Sci., 2015

Generalized Wong sequences and their applications to Edmonds' problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics.

[BibT_eX]

[DOI]

CoRR, 2015

On generating the ring of matrix semi-invariants.

[BibT_eX]

[DOI]

CoRR, 2015

Polynomial-time isomorphism test of groups that are tame extensions.

[BibT_eX]

[DOI]

CoRR, 2015

On the Power of Parity Queries in Boolean Decision Trees.

[BibT_eX]

[DOI]

Raghav Kulkarni

Proceedings of the Theory and Applications of Models of Computation, 2015

Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Random arithmetic formulas can be reconstructed efficiently.

[BibT_eX]

[DOI]

Ankit Gupta

Neeraj Kayal

Comput. Complex., 2014

An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Algorithms for group isomorphism via group extensions and cohomology.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

Determinantal Complexities and Field Extensions.

[BibT_eX]

[DOI]

Nengkun Yu

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

On Isomorphism Testing of Groups with Normal Hall Subgroups.

[BibT_eX]

[DOI]

Jayalal Sarma

Bangsheng Tang

J. Comput. Sci. Technol., 2012

On the security of Goldreich's one-way function.

[BibT_eX]

[DOI]

Andrej Bogdanov

Comput. Complex., 2012

Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers.

[BibT_eX]

[DOI]

László Babai

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract).

[BibT_eX]

[DOI]

László Babai

Paolo Codenotti

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Code Equivalence and Group Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Deterministic Identity Testing of Read-Once Algebraic Branching Programs.

[BibT_eX]

[DOI]

Maurice J. Jansen

Jayalal Sarma

Electron. Colloquium Comput. Complex., 2010

Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs.

[BibT_eX]

[DOI]

Maurice J. Jansen

Jayalal Sarma

Electron. Colloquium Comput. Complex., 2010

2008

Counting Method for Multi-party Computation over Non-abelian Groups.

[BibT_eX]

[DOI]