Skip to main content

6 Result(s)

within **uming Qiao Remove this filter English Remove this filter Discrete Mathematics in Computer Science Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Polynomial-Time Isomorphism Test of Groups that are Tame Extensions

    We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) im...

    Joshua A. Grochow, Youming Qiao in Algorithms and Computation (2015)

  2. No Access

    Chapter and Conference Paper

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

    In the theory of algebraic groups, parabolic subgroups form a crucial building block in the structural studies. In the case of general linear groups over a finite field

    Thomas Decker, Gábor Ivanyos… in Mathematical Foundations of Computer Scien… (2014)

  3. No Access

    Chapter and Conference Paper

    On the Complexity of Trial and Error for Constraint Satisfaction Problems

    In a recent work of Bei, Chen and Zhang (STOC 2013), a trial and error model of computing was introduced, and applied to some constraint satisfaction problems. In this model the input is hidden by an oracle wh...

    Gábor Ivanyos, Raghav Kulkarni, Youming Qiao… in Automata, Languages, and Programming (2014)

  4. No Access

    Chapter and Conference Paper

    Determinantal Complexities and Field Extensions

    Let \(\mathbb{F}\) be a field of characteristic ≠ 2. The determinantal complexity of a polynomial

    Youming Qiao, **aoming Sun, Nengkun Yu in Algorithms and Computation (2013)

  5. No Access

    Chapter and Conference Paper

    Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups

    We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial n logn bound on the time complexity for the general case has not been impro...

    László Babai, Paolo Codenotti, Youming Qiao in Automata, Languages, and Programming (2012)

  6. No Access

    Chapter and Conference Paper

    On the Security of Goldreich’s One-Way Function

    Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f: {0,1} n  → {0,1} m where each bit of output is a fixed...

    Andrej Bogdanov, Youming Qiao in Approximation, Randomization, and Combinat… (2009)