The following pages link to Robert Beals (Q671625):
Displayed 33 items.
- Negation-limited circuit complexity of symmetric functions (Q671626) (← links)
- Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
- Deciding finiteness for matrix groups over function fields (Q1288492) (← links)
- (Q1364418) (redirect page) (← links)
- Equivalence of binary and ternary algebraic decision trees (Q1364419) (← links)
- The complexity of matrix rank and feasible systems of linear equations (Q1961056) (← links)
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (Q2577534) (← links)
- Harmonious groups (Q2639172) (← links)
- Polynomials with a common composite (Q2655775) (← links)
- (Q2759619) (← links)
- On Orders of Subgroups in Abelian Groups: An Elementary Solution of an Exercise of Herstein (Q3107120) (← links)
- Permutation Involvement and Groups (Q3148688) (← links)
- On the Complexity of Negation-Limited Boolean Networks (Q4210099) (← links)
- (Q4222328) (← links)
- (Q4228466) (← links)
- (Q4234108) (← links)
- (Q4234184) (← links)
- (Q4234185) (← links)
- (Q4240509) (← links)
- (Q4252744) (← links)
- (Q4259996) (← links)
- (Q4273599) (← links)
- Priority Queues and Permutations (Q4327419) (← links)
- (Q4335290) (← links)
- (Q4503950) (← links)
- (Q4526969) (← links)
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I (Q4794618) (← links)
- Permutations with Restricted Cycle Structure and an Algorithmic Application (Q4796014) (← links)
- (Q4875224) (← links)
- Polynomial-time theory of matrix groups (Q5172698) (← links)
- Efficient distributed quantum computing (Q5362139) (← links)
- Quantum lower bounds by polynomials (Q5441359) (← links)
- (Q5501375) (← links)