Polynomial-time normalizers
special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity
Main Authors: | Eugene M. Luks, Takunari Miyazaki |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2011-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/531/pdf |
Similar Items
-
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01) -
On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01) -
Automaticity of primitive words and irreducible polynomials
by: Anne Lacroix, et al.
Published: (2013-01-01) -
Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01) -
Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)