scientific article; zbMATH DE number 1256667

zbMath0977.68558MaRDI QIDQ4230354

Joel Friedman

Publication date: 20 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (16)

Zero-Fixing Extractors for Sub-Logarithmic Entropy ⋮ On construction of \(k\)-wise independent random variables ⋮ On perfect 2-colorings of the \(q\)-ary \(n\)-cube ⋮ \(t\)-resilient functions and the partial exposure problem ⋮ Perfect 2‐colorings of Hamming graphs ⋮ The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes ⋮ Two results on the bit extraction problem ⋮ A note on a conjecture concerning symmetric resilient functions ⋮ A note on a conjecture concerning symmetric resilient functions ⋮ Bounds on orthogonal arrays and resilient functions ⋮ Pseudorandom generators without the XOR lemma ⋮ On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays ⋮ On unbalanced Boolean functions with best correlation immunity ⋮ Average-Case Lower Bounds for Noisy Boolean Decision Trees ⋮ Unnamed Item ⋮ Highly nonlinear resilient functions through disjoint codes in projective spaces.

This page was built for publication: