scientific article; zbMATH DE number 7651160

DOI10.4230/LIPICS.ESA.2020.21MaRDI QIDQ5874488zbMATH OpenFDO

Authors Thomas Bläsius, Tobias Friedrich, Martin Schirneck

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/1910.00308

zbMATH Keywords

Chernoff-Hoeffding theoremmaximizationmaximum entropyminimizationphase transitionrandom hypergraphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Mathematical Theory of Communication
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Asymptotic properties of keys and functional dependencies in random databases
• Binomial and Poisson distributions as maximum entropy distributions
• Black-box Complexity of Parallel Search with Distributed Populations
• Bounds on tail probabilities of discrete distributions
• Completeness for first-order properties on sparse structures with algorithmic applications
• Component structure in the evolution of random hypergraphs
• Concentration of Measure for the Analysis of Randomized Algorithms
• Distribution inequalities for the binomial law
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• Elements of Information Theory
• Exploiting hidden structure in selecting dimensions that distinguish vectors
• scientific article; zbMATH DE number 2132175 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 52032 (Why is no real title available?)
• scientific article; zbMATH DE number 3080938 (Why is no real title available?)
• Information Theory and Statistical Mechanics
• Into the square: on the complexity of some quadratic-time solvable problems
• Local limit theorems for the giant component of random hypergraphs
• Networks. An introduction.
• On the rank of a random binary matrix
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Probability Inequalities for Sums of Bounded Random Variables
• Quantum computation and quantum information. 10th anniversary edition
• Random Databases with Correlated Data
• Random Graphs
• Random graphs and complex networks. Volume 1
• Testing Functional Connection between Two Random Variables
• The order of the giant component of random hypergraphs
• The parameterized complexity of dependency detection in relational databases
• The phase transition in a random hypergraph
• The physics and mathematics of the second law of thermodynamics
• Theory of evolutionary computation. Recent developments in discrete optimization

Cited in

(3)

• Minimal functions on the random graph
• The Minrank of Random Graphs
• The Minimization of Random Hypergraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874488)