default search action
Youming Qiao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j17]Joshua A. Grochow
, Youming Qiao
On p-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors. ACM Trans. Comput. Theory 16(1): 2:1-2:39 (2024) - [c38]Anand Kumar Narayanan
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants. EUROCRYPT (3) 2024: 160-187 - [c37]Youming Qiao, Xiaorui Sun:
Canonical Forms for Matrix Tuples in Polynomial Time. FOCS 2024: 780-789 - [c36]Gábor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, Chuanqi Zhang:
Faster Isomorphism Testing of p-Groups of Frattini Class 2. FOCS 2024: 1408-1424 - [c35]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: 31:1-31:23 - [c34]Markus Bläser, Zhili Chen, Dung Hoang Duong, Antoine Joux, Tuong Ngoc Nguyen, Thomas Plantard, Youming Qiao, Willy Susilo
On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures. PQCrypto (1) 2024: 227-261 - [i39]Youming Qiao, Xiaorui Sun:
Canonical forms for matrix tuples in polynomial time. CoRR abs/2409.12457 (2024) - [i38]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: 368 (2024) - 2023
- [j16]Joshua A. Grochow
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness. SIAM J. Comput. 52(2): 568-617 (2023) - [c33]Gábor Ivanyos, Youming Qiao:
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions. SODA 2023: 4115-4126 - [i37]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 abs/2306.03135 (2023) - [i36]Joshua A. Grochow, Youming Qiao:
On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications. CoRR abs/2306.16317 (2023) - [i35]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
On linear-algebraic notions of expansion. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c32]Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao, Zhiya Chen:
Heterogeneous Multi-commodity Network Flows over Time. CSR 2022: 238-255 - [c31]Gang Tang
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms. EUROCRYPT (3) 2022: 582-612 - [c30]Gábor Ivanyos, Tushant Mittal
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras. ITCS 2022: 87:1-87:21 - [c29]Heiko Dietrich
The Isomorphism Problem for Plain Groups Is in Σ₃𝖯. STACS 2022: 26:1-26:14 - [i34]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
Connections between graphs and matrix spaces. CoRR abs/2206.04815 (2022) - [i33]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
On linear-algebraic notions of expansion. CoRR abs/2212.13154 (2022) - [i32]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: 267 (2022) - [i31]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: 1184 (2022) - 2021
- [j15]Youming Qiao
Enumerating alternating matrix spaces over finite fields with explicit coordinates. Discret. Math. 344(11): 112580 (2021) - [j14]Xiaoyu He
On the Baer-Lovász-Tutte construction of groups from graphs: Isomorphism types and homomorphism notions. Eur. J. Comb. 98: 103404 (2021) - [j13]Xiaohui Bei, Shiteng Chen
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): 924-971 (2021) - [c28]Joshua A. Grochow
On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors. CCC 2021: 16:1-16:38 - [c27]Joshua A. Grochow
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness. ITCS 2021: 31:1-31:19 - [c26]Joshua A. Grochow, Youming Qiao
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. STACS 2021: 38:1-38:17 - [i30]Gábor Ivanyos, Tushant Mittal, Youming Qiao:
Symbolic determinant identity testing and non-commutative ranks of matrix Lie algebras. CoRR abs/2109.06403 (2021) - [i29]Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß:
The isomorphism problem for plain groups is in Σ3P. CoRR abs/2110.00900 (2021) - 2020
- [j12]Youming Qiao
Local Equivalence of Multipartite Entanglement. IEEE J. Sel. Areas Commun. 38(3): 568-574 (2020) - [c25]Peter A. Brooksbank
Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice. ESA 2020: 26:1-26:15 - [c24]Xiaohui Bei
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces. ITCS 2020: 8:1-8:48 - [i28]Joshua A. Grochow, Youming Qiao, Gang Tang:
Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms. CoRR abs/2012.01085 (2020)
2010 – 2019
- 2019
- [j11]Gábor Ivanyos
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): 926-963 (2019) - [c23]Zhengfeng Ji, Youming Qiao, Fang Song
General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography. TCC (1) 2019: 251-281 - [i27]Xiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, Xiaoming Sun:
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions. CoRR abs/1904.03950 (2019) - [i26]Peter A. Brooksbank, Joshua A. Grochow, Yinan Li, Youming Qiao, James B. Wilson:
Incorporating Weisfeiler-Leman into algorithms for group isomorphism. CoRR abs/1905.02518 (2019) - [i25]Zhengfeng Ji, Youming Qiao, Fang Song, Aaram Yun:
General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography. CoRR abs/1906.04330 (2019) - [i24]Joshua A. Grochow, Youming Qiao:
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions. CoRR abs/1907.00309 (2019) - [i23]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: 687 (2019) - 2018
- [j10]Gábor Ivanyos
Constructive non-commutative rank computation is in deterministic polynomial time. Comput. Complex. 27(4): 561-593 (2018) - [j9]Gábor Ivanyos
On the complexity of trial and error for constraint satisfaction problems. J. Comput. Syst. Sci. 92: 48-64 (2018) - [c22]Gábor Ivanyos
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. SODA 2018: 2357-2376 - 2017
- [j8]Gábor Ivanyos
Non-commutative Edmonds' problem and matrix semi-invariants. Comput. Complex. 26(3): 717-763 (2017) - [j7]Priyanka Mukhopadhyay
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials. Comput. Complex. 26(4): 881-909 (2017) - [j6]Joshua A. Grochow, Youming Qiao
Algorithms for Group Isomorphism via Group Extensions and Cohomology. SIAM J. Comput. 46(4): 1153-1216 (2017) - [c21]Aleksandrs Belovs, Gábor Ivanyos
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CCC 2017: 30:1-30:24 - [c20]Yinan Li, Youming Qiao
Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model. FOCS 2017: 463-474 - [c19]Xiaohui Bei
Networked Fairness in Cake Cutting. IJCAI 2017: 3632-3638 - [c18]Gábor Ivanyos
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ITCS 2017: 55:1-55:19 - [i22]Xiaohui Bei, Youming Qiao, Shengyu Zhang:
Networked Fairness in Cake Cutting. CoRR abs/1707.02033 (2017) - [i21]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 abs/1708.03495 (2017) - [i20]Yinan Li, Youming Qiao:
Linear algebraic analogues of the graph isomorphism problem and the Erdős-Rényi model. CoRR abs/1708.04501 (2017) - [i19]Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang:
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CoRR abs/1710.08602 (2017) - 2016
- [c17]Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao
Boundaries of VP and VNP. ICALP 2016: 34:1-34:14 - [i18]Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao:
Boundaries of VP and VNP. CoRR abs/1605.02815 (2016) - 2015
- [j5]Gábor Ivanyos
Generalized Wong sequences and their applications to Edmonds' problems. J. Comput. Syst. Sci. 81(7): 1373-1386 (2015) - [j4]Raghav Kulkarni, Youming Qiao
Any monotone property of 3-uniform hypergraphs is weakly evasive. Theor. Comput. Sci. 588: 16-23 (2015) - [c16]Joshua A. Grochow, Youming Qiao
Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract). ISAAC 2015: 578-589 - [c15]Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
On the Power of Parity Queries in Boolean Decision Trees. TAMC 2015: 99-109 - [i17]Priyanka Mukhopadhyay, Youming Qiao:
Sparse multivariate polynomial interpolation in the basis of Schubert polynomials. CoRR abs/1504.03856 (2015) - [i16]Joshua A. Grochow, Youming Qiao:
Polynomial-time isomorphism test of groups that are tame extensions. CoRR abs/1507.01917 (2015) - [i15]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Non-commutative Edmonds' problem and matrix semi-invariants. CoRR abs/1508.00690 (2015) - [i14]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
On generating the ring of matrix semi-invariants. CoRR abs/1508.01554 (2015) - [i13]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. CoRR abs/1512.03531 (2015) - 2014
- [j3]Ankit Gupta, Neeraj Kayal, Youming Qiao
Random arithmetic formulas can be reconstructed efficiently. Comput. Complex. 23(2): 207-303 (2014) - [c14]Joshua A. Grochow, Youming Qiao
Algorithms for Group Isomorphism via Group Extensions and Cohomology. CCC 2014: 110-119 - [c13]Gábor Ivanyos
On the Complexity of Trial and Error for Constraint Satisfaction Problems. ICALP (1) 2014: 663-675 - [c12]Thomas Decker, Gábor Ivanyos
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. MFCS (2) 2014: 226-238 - [c11]Gábor Ivanyos
Generalized Wong sequences and their applications to Edmonds' problems. STACS 2014: 397-408 - [i12]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR abs/1406.5336 (2014) - [i11]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. TR14 (2014) - [i10]Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c10]Ankit Gupta, Neeraj Kayal, Youming Qiao
Random Arithmetic Formulas Can Be Reconstructed Efficiently. CCC 2013: 1-9 - [c9]Youming Qiao, Xiaoming Sun, Nengkun Yu
Determinantal Complexities and Field Extensions. ISAAC 2013: 119-129 - [c8]Raghav Kulkarni, Youming Qiao, Xiaoming Sun
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. TAMC 2013: 224-235 - [i9]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. CoRR abs/1307.6429 (2013) - [i8]Joshua A. Grochow, Youming Qiao:
Algorithms for group isomorphism via group extensions and cohomology. CoRR abs/1309.1776 (2013) - [i7]Joshua A. Grochow, Youming Qiao:
Algorithms for group isomorphism via group extensions and cohomology. Electron. Colloquium Comput. Complex. TR13 (2013) - [i6]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j2]Andrej Bogdanov, Youming Qiao
On the security of Goldreich's one-way function. Comput. Complex. 21(1): 83-127 (2012) - [j1]Youming Qiao
On Isomorphism Testing of Groups with Normal Hall Subgroups. J. Comput. Sci. Technol. 27(4): 687-701 (2012) - [c7]László Babai
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract). ICALP (1) 2012: 51-62 - [c6]László Babai
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. STACS 2012: 453-464 - [i5]Ankit Gupta, Neeraj Kayal, Youming Qiao:
Random Arithmetic Formulas can be Reconstructed Efficiently. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c5]László Babai
Code Equivalence and Group Isomorphism. SODA 2011: 1395-1408 - [c4]Youming Qiao
On Isomorphism Testing of Groups with Normal Hall Subgroups. STACS 2011: 567-578 - 2010
- [c3]Maurice J. Jansen, Youming Qiao
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. FSTTCS 2010: 296-307 - [i4]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs. CoRR abs/1002.1496 (2010) - [i3]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010) - [i2]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c2]Andrej Bogdanov, Youming Qiao
On the Security of Goldreich's One-Way Function. APPROX-RANDOM 2009: 392-405 - [i1]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. CoRR abs/0912.2565 (2009) - 2008
- [c1]Youming Qiao
Counting Method for Multi-party Computation over Non-abelian Groups. CANS 2008: 162-177
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: