Parcourir par

  • Revues
  • Séminaires
  • Livres
  • Congrès
  • Sources

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Discrete mathematics & theoretical computer science
Tome 13 (2011)
no. 4
Précédent Suivant

Volume 13 (2011) no. 4

Sommaire


Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday
Seress, Akos ; Szegedy, Mario

Polynomial-time normalizers
Luks, Eugene M. ; Miyazaki, Takunari

On the metric dimension of Grassmann graphs
Bailey, Robert F. ; Meagher, Karen

The extended equivalence and equation solvability problems for groups
Horvath, Gabor ; Szabo, Csaba

On the residual solvability of generalized free products of solvable groups
Kahrobaei, Delaram ; Majewicz, Stephen

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
Hayes, Thomas P.

On the sensitivity of cyclically-invariant Boolean functions
Chakraborty, Sourav

On the minimal distance of a polynomial code
Pach, Peter Pal ; Szabo, Csaba

Computing tensor decompositions of finite matrix groups
Ankaralioglu, Nurullah ; Seress, Akos
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité