E-LIB Suche - Ergebnisse für: Beals, Robert

1

Efficient distributed quantum computing:

Beals, Robert ; Brierley, Stephen ; Gray, Oliver...
Proceedings: Mathematical, Physical and Engineering Sciences. 469 (2013) 2153 - p. 1-20 , 2013

Link: https://www.jstor.org/st..

2

On Orders of Subgroups in Abelian Groups: An Elementary Sol..:

Beals, Robert
The American Mathematical Monthly. 116 (2009) 10 - p. 923-926 , 2009

Link: https://www.jstor.org/st..

3

On Orders of Subgroups in Abelian Groups: An Elementary Sol..:

Beals, Robert
American Mathematical Monthly. 116 (2009) 10 - p. 923-926 , 2009

Link: https://doi.org/10.4169/..

4

Polynomial-time theory of matrix groups:

, In: Proceedings of the forty-first annual ACM symposium on Theory of computing,

Babai, László ; Beals, Robert ; Seress, Ákos - p. 55-64 , 2009

Link: https://dl.acm.org/doi/1..

5

Constructive recognition of finite alternating and symmetri..:

Beals, Robert ; Leedham-Green, Charles R. ; Niemeyer, Alice C...
Journal of Algebra. 292 (2005) 1 - p. 4-46 , 2005

Link: https://doi.org/10.1016/..

6

On the diameter of the symmetric group : polynomial boun..:

, In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms,

Babai, László ; Beals, Robert ; Seress, Ákos - p. 1108-1112 , 2004

Link: https://dl.acm.org/doi/1..

7

A Black-Box Group Algorithm for Recognizing Finite Symmetri..:

Beals, Robert ; Leedham-Green, Charles R. ; Niemeyer, Alice C...
Transactions of the American Mathematical Society. 355 (2003) 5 - p. 2097-2113 , 2003

Link: https://www.jstor.org/st..

8

Permutations with Restricted Cycle Structure and an Algorit..:

BEALS, ROBERT ; LEEDHAM-GREEN, CHARLES R. ; NIEMEYER, ALICE C...
Combinatorics, Probability and Computing. 11 (2002) 5 - p. 447-464 , 2002

Link: https://doi.org/10.1017/..

9

Quantum lower bounds by polynomials:

Beals, Robert ; Buhrman, Harry ; Cleve, Richard..
Journal of the ACM (JACM). 48 (2001) 4 - p. 778-797 , 2001

Link: https://dl.acm.org/doi/1..

10

Quantum lower bounds by polynomials:

Beals, Robert ; Buhrman, Harry ; Cleve, Richard..
Journal of the ACM. 48 (2001) 4 - p. 778-797 , 2001

Link: https://doi.org/10.1145/..

11

Algorithms for Matrix Groups and the Tits Alternative:

Beals, Robert
Journal of Computer and System Sciences. 58 (1999) 2 - p. 260-279 , 1999

Link: https://doi.org/10.1006/..

12

Deciding finiteness for matrix groups over function fields:

Rockmore, Daniel N. ; Tan, Ki-Seng ; Beals, Robert
Israel Journal of Mathematics. 109 (1999) 1 - p. 93-116 , 1999

Link: https://doi.org/10.1007/..

13

On the Complexity of Negation-Limited Boolean Networks:

Beals, Robert ; Nishino, Tetsuro ; Tanaka, Keisuke
SIAM Journal on Computing. 27 (1998) 5 - p. 1334-1347 , 1998

Link: https://doi.org/10.1137/..

14

Quantum computation of Fourier transforms over symmetric gr..:

, In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing,

Beals, Robert - p. 48-53 , 1997

Link: https://dl.acm.org/doi/1..

15

The complexity of matrix rank and feasible systems of linea..:

, In: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing,

Allender, Eric ; Beals, Robert ; Ogihara, Mitsunori - p. 161-167 , 1996

Link: https://dl.acm.org/doi/1..