Printer Friendly

Articles from Discrete Mathematics and Theoretical Computer Science (December 1, 2011)

1-8 out of 8 article(s)
Title Author Type Words
Combinatorics, groups, algorithms, and complexity: conference in honor of Laci Babai's 60th birthday. Seress, Akos; Szegedy, Mario Conference news 938
Computing tensor decompositions of finite matrix groups. Ankaralioglu, Nurullah; Seress, Akos Report 4144
On the minimal distance of a polynomial code. Pach, Peter Pal; Szabo, Csaba Report 3330
On the residual solvability of generalized free products of solvable groups. Kahrobaei, Delaram; Majewicz, Stephen Report 2352
On the sensitivity of cyclically-invariant Boolean functions. Chakraborty, Sourav Report 5500
Polynomial-time normalizers. Luks, Eugene M.; Miyazaki, Takunari Report 23821
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. Hayes, Thomas P. Report 3511
The extended equivalence and equation solvability problems for groups. Horvath, Gabor; Szabo, Csaba Report 6147

Terms of use | Privacy policy | Copyright © 2020 Farlex, Inc. | Feedback | For webmasters