Youming Qiao

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 53

Top Topics

Disjunctive Temporal

Digital Signature

Constraint Satisfaction Problems

Monotonicity Property

Top Venues

IACR Cryptol. ePrint Arch.

SIAM J. Comput.

Publications

Zhili Chen, Joshua A. Grochow, Youming Qiao, Gang Tang, Chuanqi Zhang
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups. ITCS (2024)
Markus Bläser, Zhili Chen, Dung Hoang Duong, Antoine Joux, Tuong Ngoc Nguyen, Thomas Plantard, Youming Qiao, Willy Susilo, Gang Tang
On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures. PQCrypto (1) (2024)
Joshua A. Grochow, Youming Qiao
-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors. ACM Trans. Comput. Theory 16 (1) (2024)
Anand Kumar Narayanan, Youming Qiao, Gang Tang
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. EUROCRYPT (3) (2024)
Anand Kumar Narayanan, Youming Qiao, Gang Tang
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. IACR Cryptol. ePrint Arch. 2024 (2024)
Joshua A. Grochow, Youming Qiao
On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications. CoRR (2023)
Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang
On linear-algebraic notions of expansion. Electron. Colloquium Comput. Complex. (2023)
Gábor Ivanyos, Youming Qiao
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions. SODA (2023)
Joshua A. Grochow, Youming Qiao
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness. SIAM J. Comput. 52 (2) (2023)
Zhili Chen, Joshua A. Grochow, Youming Qiao, Gang Tang, Chuanqi Zhang
On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups. CoRR (2023)
Gang Tang, Dung Hoang Duong, Antoine Joux, Thomas Plantard, Youming Qiao, Willy Susilo
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms. EUROCRYPT (3) (2022)
Gábor Ivanyos, Tushant Mittal, Youming Qiao
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras. ITCS (2022)
Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang
Connections between graphs and matrix spaces. CoRR (2022)
Gang Tang, Dung Hoang Duong, Antoine Joux, Thomas Plantard, Youming Qiao, Willy Susilo
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms. IACR Cryptol. ePrint Arch. 2022 (2022)
Zhili Chen, Dung Hoang Duong, Tuong Ngoc Nguyen, Youming Qiao, Willy Susilo, Gang Tang
On digital signatures based on isomorphism problems: QROM security and ring signatures. IACR Cryptol. ePrint Arch. 2022 (2022)
Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß
. STACS (2022)
Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang
On linear-algebraic notions of expansion. CoRR (2022)
Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao, Zhiya Chen
Heterogeneous Multi-commodity Network Flows over Time. CSR (2022)
Joshua A. Grochow, Youming Qiao
On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors. Computational Complexity Conference (2021)
Youming Qiao
Enumerating alternating matrix spaces over finite fields with explicit coordinates. Discret. Math. 344 (11) (2021)
Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß
. CoRR (2021)
Joshua A. Grochow, Youming Qiao
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness. ITCS (2021)
Xiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, Xiaoming Sun
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces. SIAM J. Comput. 50 (3) (2021)
Gábor Ivanyos, Tushant Mittal, Youming Qiao
Symbolic determinant identity testing and non-commutative ranks of matrix Lie algebras. CoRR (2021)
Xiaoyu He, Youming Qiao
On the Baer-Lovász-Tutte construction of groups from graphs: Isomorphism types and homomorphism notions. Eur. J. Comb. 98 (2021)
Joshua A. Grochow, Youming Qiao, Gang Tang
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. STACS (2021)
Joshua A. Grochow, Youming Qiao, Gang Tang
Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms. CoRR (2020)
Peter A. Brooksbank, Yinan Li, Youming Qiao, James B. Wilson
Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice. ESA (2020)
Xiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, Xiaoming Sun
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces. ITCS (2020)
Youming Qiao, Xiaoming Sun, Nengkun Yu
Local Equivalence of Multipartite Entanglement. IEEE J. Sel. Areas Commun. 38 (3) (2020)
Joshua A. Grochow, Youming Qiao
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions. CoRR (2019)
Peter A. Brooksbank, Joshua A. Grochow, Yinan Li, Youming Qiao, James B. Wilson
Incorporating Weisfeiler-Leman into algorithms for group isomorphism. CoRR (2019)
Xiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, Xiaoming Sun
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions. CoRR (2019)
Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun
General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography. CoRR (2019)
Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun
General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography. IACR Cryptol. ePrint Arch. 2019 (2019)
Gábor Ivanyos, Youming Qiao
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing. SIAM J. Comput. 48 (3) (2019)
Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun
General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography. TCC (1) (2019)
Gábor Ivanyos, Youming Qiao
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. SODA (2018)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the complexity of trial and error for constraint satisfaction problems. J. Comput. Syst. Sci. 92 (2018)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive non-commutative rank computation is in deterministic polynomial time. Comput. Complex. 27 (4) (2018)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Non-commutative Edmonds' problem and matrix semi-invariants. Comput. Complex. 26 (3) (2017)
Yinan Li, Youming Qiao
Linear algebraic analogues of the graph isomorphism problem and the Erdős-Rényi model. CoRR (2017)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ITCS (2017)
Joshua A. Grochow, Youming Qiao
Algorithms for Group Isomorphism via Group Extensions and Cohomology. SIAM J. Comput. 46 (4) (2017)
Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. Computational Complexity Conference (2017)
Gábor Ivanyos, Youming Qiao
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. CoRR (2017)
Priyanka Mukhopadhyay, Youming Qiao
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials. Comput. Complex. 26 (4) (2017)
Yinan Li, Youming Qiao
Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model. FOCS (2017)
Xiaohui Bei, Youming Qiao, Shengyu Zhang
Networked Fairness in Cake Cutting. IJCAI (2017)
Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CoRR (2017)
Xiaohui Bei, Youming Qiao, Shengyu Zhang
Networked Fairness in Cake Cutting. CoRR (2017)
Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao
Boundaries of VP and VNP. ICALP (2016)
Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao
Boundaries of VP and VNP. CoRR (2016)
Joshua A. Grochow, Youming Qiao
Polynomial-time isomorphism test of groups that are tame extensions. CoRR (2015)
Raghav Kulkarni, Youming Qiao, Xiaoming Sun
Any monotone property of 3-uniform hypergraphs is weakly evasive. Theor. Comput. Sci. 588 (2015)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. CoRR (2015)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Non-commutative Edmonds' problem and matrix semi-invariants. CoRR (2015)
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems. J. Comput. Syst. Sci. 81 (7) (2015)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
On generating the ring of matrix semi-invariants. CoRR (2015)
Raghav Kulkarni, Youming Qiao, Xiaoming Sun
On the Power of Parity Queries in Boolean Decision Trees. TAMC (2015)
Priyanka Mukhopadhyay, Youming Qiao
Sparse multivariate polynomial interpolation in the basis of Schubert polynomials. CoRR (2015)
Joshua A. Grochow, Youming Qiao
Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract). ISAAC (2015)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the Complexity of Trial and Error for Constraint Satisfaction Problems. ICALP (1) (2014)
Joshua A. Grochow, Youming Qiao
Algorithms for Group Isomorphism via Group Extensions and Cohomology. Computational Complexity Conference (2014)
Raghav Kulkarni, Youming Qiao, Xiaoming Sun
Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive. Electron. Colloquium Comput. Complex. 21 (2014)
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems. STACS (2014)
Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. MFCS (2) (2014)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the complexity of trial and error for constraint satisfaction problems. Electron. Colloquium Comput. Complex. 21 (2014)
Ankit Gupta, Neeraj Kayal, Youming Qiao
Random arithmetic formulas can be reconstructed efficiently. Comput. Complex. 23 (2) (2014)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR (2014)
Joshua A. Grochow, Youming Qiao
Algorithms for group isomorphism via group extensions and cohomology. Electron. Colloquium Comput. Complex. 20 (2013)
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems. CoRR (2013)
Joshua A. Grochow, Youming Qiao
Algorithms for group isomorphism via group extensions and cohomology. CoRR (2013)
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems. Electron. Colloquium Comput. Complex. 20 (2013)
Ankit Gupta, Neeraj Kayal, Youming Qiao
Random Arithmetic Formulas Can Be Reconstructed Efficiently. Computational Complexity Conference (2013)
Raghav Kulkarni, Youming Qiao, Xiaoming Sun
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. TAMC (2013)
Youming Qiao, Xiaoming Sun, Nengkun Yu
Determinantal Complexities and Field Extensions. ISAAC (2013)
László Babai, Paolo Codenotti, Youming Qiao
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract). ICALP (1) (2012)
László Babai, Youming Qiao
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. STACS (2012)
Andrej Bogdanov, Youming Qiao
On the security of Goldreich's one-way function. Comput. Complex. 21 (1) (2012)
Ankit Gupta, Neeraj Kayal, Youming Qiao
Random Arithmetic Formulas can be Reconstructed Efficiently. Electron. Colloquium Comput. Complex. 19 (2012)
Youming Qiao, Jayalal Sarma, Bangsheng Tang
On Isomorphism Testing of Groups with Normal Hall Subgroups. J. Comput. Sci. Technol. 27 (4) (2012)
László Babai, Paolo Codenotti, Joshua A. Grochow, Youming Qiao
Code Equivalence and Group Isomorphism. SODA (2011)
Youming Qiao, Jayalal Sarma, Bangsheng Tang
On Isomorphism Testing of Groups with Normal Hall Subgroups. STACS (2011)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 17 (2010)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs CoRR (2010)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 17 (2010)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. FSTTCS (2010)
Andrej Bogdanov, Youming Qiao
On the Security of Goldreich's One-Way Function. APPROX-RANDOM (2009)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Identity Testing of Read-Once Algebraic Branching Programs CoRR (2009)
Youming Qiao, Christophe Tartary
Counting Method for Multi-party Computation over Non-abelian Groups. CANS (2008)