Optimal linear perfect hash families (Q1269893)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Optimal linear perfect hash families	scientific article

Statements

scholarly article

0 references

Optimal linear perfect hash families (English)

0 references

Simon R. Blackburn

0 references

0 references

Journal of Combinatorial Theory. Series A

0 references

publication date

18 October 1998

0 references

full work available at URL

https://semanticscholar.org/paper/ca676b173b6a437c899eb15515235c4c8a8c5e2d

0 references

zbMATH Keywords

perfect has families

0 references

MaRDI profile type

MaRDI publication profile

0 references

Explicit construction of exponential sized families of k-independent sets

0 references

Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions

0 references

0 references

Efficient Multiplicative Sharing Schemes

0 references

On the Size of Separating Systems and Families of Perfect Hash Functions

0 references

0 references

0 references

Fredman–Komlós bounds and information theory

0 references

New bounds for perfect hashing via information theory

0 references

0 references

Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy

0 references

Automorphisms of unitary block designs

0 references

Improved bounds for covering complete uniform hypergraphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1006/JCTA.1998.2876

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1269893

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1269893&oldid=38620037"