The following pages link to Michael Clausen (Q705547):
Displaying 50 items.
- (Q597052) (redirect page) (← links)
- Generating fast Fourier transforms of solvable groups (Q597054) (← links)
- (Q685451) (redirect page) (← links)
- Cayley automata (Q685452) (← links)
- Approximately matching polygonal curves with respect to the Fréchet distance (Q705548) (← links)
- Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\) (Q710991) (← links)
- Dominance orders, Capelli operators, and straightening of bideterminants (Q801063) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- Sequential machines realized by group representations (Q807027) (← links)
- Multivariate polynomials, standard tableaux, and representations of symmetric groups (Q810138) (← links)
- Improved upper complexity bounds for the discrete Fourier transform (Q811112) (← links)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions (Q820943) (← links)
- A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs (Q1005227) (← links)
- Jeu de taquin and connected standard skew tableaux (Q1051642) (← links)
- On a class of primary algebras of minimal rank (Q1063670) (← links)
- On the Steinberg module, representations of the symmetric groups, and the Steenrod algebra (Q1076135) (← links)
- Orthogonality of the characters of \(S_ n\) (Q1076136) (← links)
- A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657) (← links)
- Some considerations about NPRIORITY(1) without ROM (Q1113673) (← links)
- Efficient solution of linear diophantine equations (Q1121310) (← links)
- Fast generalized Fourier transforms (Q1123578) (← links)
- Letter place algebras and a characteristic-free approach to the representation theory of the general linear and symmetric groups. I (Q1135357) (← links)
- Letter place algebras and a characteristic-free approach to the representation theory of the general linear and symmetric groups. II (Q1149508) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- Almost all Boolean functions have no linear symmetries (Q1197985) (← links)
- On the intrinsic complexity of elimination theory (Q1330148) (← links)
- A direct proof of Minkwitz's extension theorem (Q1361008) (← links)
- Algebraic complexity theory. I: An introduction (Q1380696) (← links)
- Algebraic complexity theory. III: On the complexity of the computation of permanents (Q1380698) (← links)
- DFT-based word normalization in finite supersolvable groups. (Q1762552) (← links)
- On optimal algorithms for problems defined on groups (Q1824380) (← links)
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\) (Q2284962) (← links)
- (Q2724737) (← links)
- (Q3142319) (← links)
- (Q3143773) (← links)
- (Q3320397) (← links)
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses (Q3355210) (← links)
- (Q3665304) (← links)
- Fast Fourier Transforms for Metabelian Groups (Q3833610) (← links)
- (Q3882621) (← links)
- A straightening formula for bipermanents (Q3936897) (← links)
- (Q3961006) (← links)
- (Q4023198) (← links)
- (Q4273600) (← links)
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation (Q4274400) (← links)
- (Q4288094) (← links)
- (Q4298259) (← links)
- Computing Irreducible Representations of Supersolvable Groups (Q4305962) (← links)
- (Q4331740) (← links)
- (Q4502609) (← links)
