9 citations · 15 across the 2 of their papers we have counts for
2 papers
cs.DM2017★ 6 cited
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger +2
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory.…
cs.DM2015★ 9 cited
On the diameter of hyperbolic random graphs
Tobias Friedrich, Anton Krohmer
Large real-world networks are typically scale-free. Recent research has shown that such graphs are described best in a geometric space. More precisely, the internet can be mapped t…