96 citations · 376 across the 69 of their papers we have counts for
Showing 2019 · cs.DMShow all
2 papers · 2 filters
cs.DM2019
The Minimization of Random Hypergraphs
Thomas Bläsius, Tobias Friedrich, Martin Schirneck
We investigate the maximum-entropy model for random -vertex, -edge multi-hypergraphs with expected edge size . We show that the expected size of the…
cs.DM2019★ 3 cited
The Satisfiability Threshold for Non-Uniform Random 2-SAT
Tobias Friedrich, Ralf Rothenberger
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. Its worst-case hardness lies at the core of computational complexity theory, for exa…