Pages that link to "Item:Q3038628"

The following pages link to On the Size of Separating Systems and Families of Perfect Hash Functions (Q3038628):

Displaying 49 items.

• On two continuum armed bandit problems in high dimensions (Q260274) (← links)
• On generalizations of separating and splitting families (Q311557) (← links)
• Orientations making \(k\)-cycles cyclic (Q503634) (← links)
• Symmetric graphs with respect to graph entropy (Q510346) (← links)
• Approximation of functions of few variables in high dimensions (Q623354) (← links)
• Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
• The hat guessing number of graphs (Q777481) (← links)
• Generalised cumulative arrays in secret sharing (Q851749) (← links)
• Secret sharing schemes with partial broadcast channels (Q851779) (← links)
• Perfect hash families of strength three with three rows from varieties on finite projective geometries (Q887417) (← links)
• Entropy of symmetric graphs (Q898092) (← links)
• Explicit constructions for perfect hash families (Q1008968) (← links)
• Information compression and Varshamov-Gilbert bound (Q1099128) (← links)
• Construction of universal enumerators and formulas for threshold functions (Q1121855) (← links)
• New bounds for perfect hashing via information theory (Q1122979) (← links)
• Improved bounds for covering complete uniform hypergraphs (Q1190514) (← links)
• Optimal linear perfect hash families (Q1269893) (← links)
• \(\Sigma\Pi\Sigma\) threshold formulas (Q1340142) (← links)
• Better lower bounds for monotone threshold formulas (Q1356879) (← links)
• Removing Ramsey theory: Lower bounds with smaller domain size (Q1392014) (← links)
• Generalized hashing and parent-identifying codes. (Q1417959) (← links)
• Splitting systems and separating systems. (Q1428538) (← links)
• Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
• A note on Ramsey numbers for Berge-\(G\) hypergraphs (Q1732754) (← links)
• Randomness in secret sharing and visual cryptography schemes (Q1826638) (← links)
• Anti-Ramsey colorings in several rounds (Q1850529) (← links)
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
• Some bounds of weighted entropies with augmented Zagreb index edge weights (Q2004176) (← links)
• A generalization of the Bollobás set pairs inequality (Q2040005) (← links)
• Beating Fredman-Komlós for perfect \(k\)-hashing (Q2077264) (← links)
• New bounds for perfect \(k\)-hashing (Q2217492) (← links)
• Information based complexity for high dimensional sparse functions (Q2303421) (← links)
• Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
• Complexity of approximation of functions of few variables in high dimensions (Q2431335) (← links)
• On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
• Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
• Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
• On the Circuit Complexity of Perfect Hashing (Q3088172) (← links)
• Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing (Q3297627) (← links)
• Semi-external LTL Model Checking (Q3512515) (← links)
• Fredman–Komlós bounds and information theory (Q3739153) (← links)
• Perfect Hashing and Probability (Q4314156) (← links)
• Beating Fredman-Komlós for Perfect k-Hashing. (Q5091253) (← links)
• Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
• Separation and Witnesses (Q5322994) (← links)
• The combinatorics of generalised cumulative arrays (Q5443560) (← links)
• Explicit constructions of perfect hash families from algebraic curves over finite fields (Q5929836) (← links)
• Recursive bounds for perfect hashing (Q5939232) (← links)
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)