An Upper Bound ford-dimensional Difference Sets
- 期刊名称Combinatorica
- 作者Yonutz V. Stanchescu
- 卷第21卷
- 期第4期
- 印刷ISSN0209-9683
- 电子ISSN1439-6912
- 文件大小126.38KB
- 发表时间2001-10
- DOI10.1007/s004930100015
- 页码591-595
Crooked maps inGohar M. Kyureghyan · 2007
The only crooked power functions areGohar M. Kyureghyan · 2007
Crooked binomialsJürgen Bierbrauer; Gohar M. Kyureghyan · 2008
Perfect nonlinear binomials and their semifieldsZhengbang Zha; Gohar M. Kyureghyan; Xueli Wang · 2009
Irreducible compositions of polynomials over finite fieldsMelsik K. Kyuregyan; Gohar M. Kyureghyan · 2011
A new class of monomial bent functionsAnne Canteaut; Pascale Charpin; Gohar M. Kyureghyan · 2008
Minimal Polynomials of the Modified de Bruijn SequencesGohar M. Kyureghyan · 2005
Diametric theorems in sequence spacesR. Ahlswede; N. Cai; Z. Zhang · Combinatorica · 1992
Small transversals in hypergraphsV. Chvátal; C. McDiarmid · Combinatorica · 1992
On integer points in polyhedraW. Cook; M. Hartmann; R. Kannan; C. McDiarmid · Combinatorica · 1992
Spanning trees of extended graphsA. K. Kelmans · Combinatorica · 1992
On rank vs. communication complexityNoam Nisan; Avi Wigderson · Combinatorica · 1995
Colouring a graph frugallyHugh Hind; Michael Molloy; Bruce Reed · Combinatorica · 1997
Expanding graphs and invariant meansYehuda Shalom · Combinatorica · 1997
Universally signable graphsMichele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković · Combinatorica · 1997