Youming Qiao
Cited by
Cited by
On the security of Goldreich’s one-way function
A Bogdanov, Y Qiao
Computational complexity 21 (1), 83-127, 2012
Constructive non-commutative rank computation is in deterministic polynomial time
G Ivanyos, Y Qiao, KV Subrahmanyam
computational complexity 27 (4), 561-593, 2018
Code equivalence and group isomorphism
L Babai, P Codenotti, JA Grochow, Y Qiao
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
Non-commutative Edmonds’ problem and matrix semi-invariants
G Ivanyos, Y Qiao, KV Subrahmanyam
computational complexity 26 (3), 717-763, 2017
Generalized Wong sequences and their applications to Edmonds' problems
G Ivanyos, M Karpinski, Y Qiao, M Santha
Journal of Computer and System Sciences 81 (7), 1373-1386, 2015
Polynomial-time isomorphism test for groups with abelian Sylow towers
L Babai, Y Qiao
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
On isomorphism testing of groups with normal Hall subgroups
YM Qiao, J Sarma, BS Tang
Journal of Computer Science and Technology 27 (4), 687-701, 2012
Polynomial-Time Isomorphism Test for Groups with no Abelian Normal Subgroups (Extended Abstract⋆)
L Babai, P Codenotti, Y Qiao
International Colloquium on Automata, Languages, and Programming (ICALP) 2012, 2012
Algorithms for group isomorphism via group extensions and cohomology
JA Grochow, Y Qiao
SIAM Journal on Computing 46 (4), 1153-1216, 2017
Boundaries of VP and VNP
JA Grochow, KD Mulmuley, Y Qiao
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
Networked Fairness in Cake Cutting
X Bei, Y Qiao, S Zhang
The Twenty-Sixth International Joint Conference on Artificial Intelligence …, 2017
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
G Ivanyos, Y Qiao
SIAM Journal on Computing 48 (3), 926-963, 2019
Deterministic Black-Box Identity Testing -Ordered Algebraic Branching Programs
M Jansen, Y Qiao, J Sarma
arXiv preprint arXiv:1002.1496, 2010
Random arithmetic formulas can be reconstructed efficiently
A Gupta, N Kayal, Y Qiao
computational complexity 23 (2), 207-303, 2014
Deterministic identity testing of read-once algebraic branching programs
M Jansen, Y Qiao, J Sarma
arXiv preprint arXiv:0912.2565, 2009
On the polynomial parity argument complexity of the combinatorial nullstellensatz
A Belovs, G Ivanyos, Y Qiao, M Santha, S Yang
Computational Complexity Conference 2017, 30:1-30:24, 2017
Linear algebraic analogues of the graph isomorphism problem and the Erdős-Rényi model
Y Li, Y Qiao
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Polynomial-time isomorphism test of groups that are tame extensions
JA Grochow, Y Qiao
International Symposium on Algorithms and Computation, 578-589, 2015
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
JA Grochow, Y Qiao
arXiv preprint arXiv:1907.00309, 2019
Any monotone property of 3-uniform hypergraphs is weakly evasive
R Kulkarni, Y Qiao, X Sun
Theoretical Computer Science 588, 16-23, 2015
The system can't perform the operation now. Try again later.
Articles 1–20