Publication:5874488

DOI10.4230/LIPIcs.ESA.2020.21MaRDI QIDQ5874488

Tobias Friedrich, Thomas Bläsius, Martin Schirneck

Publication date: 7 February 2023

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

zbMATH Keywords

phase transition; minimization; maximum entropy; maximization; random hypergraphs; Chernoff-Hoeffding theorem

Mathematics Subject Classification ID

68Wxx: Algorithms in computer science

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Into the square: on the complexity of some quadratic-time solvable problems
• Exploiting hidden structure in selecting dimensions that distinguish vectors
• Component structure in the evolution of random hypergraphs
• Distribution inequalities for the binomial law
• Asymptotic properties of keys and functional dependencies in random databases
• The physics and mathematics of the second law of thermodynamics
• The phase transition in a random hypergraph
• A new algorithm for optimal 2-constraint satisfaction and its implications
• BOUNDS ON TAIL PROBABILITIES OF DISCRETE DISTRIBUTIONS
• Random Graphs and Complex Networks
• Testing Functional Connection between Two Random Variables
• Black-box Complexity of Parallel Search with Distributed Populations
• The order of the giant component of random hypergraphs
• Quantum Computation and Quantum Information
• Random Databases with Correlated Data
• Information Theory and Statistical Mechanics
• Binomial and Poisson distributions as maximum entropy distributions
• Completeness for First-order Properties on Sparse Structures with Algorithmic Applications
• Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
• On the rank of a random binary matrix
• Theory of Evolutionary Computation
• Probability Inequalities for Sums of Bounded Random Variables
• Local Limit Theorems for the Giant Component of Random Hypergraphs
• Elements of Information Theory
• Random Graphs
• Concentration of Measure for the Analysis of Randomized Algorithms
• Networks