6 citations · 17 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
Tobias Friedrich, Andreas Göbel, Frank Neumann +2
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular…
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.…
Greed is Good for Deterministic Scale-Free Networks
Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
Large real-world networks typically follow a power-law degree distribution. To study such networks, numerous random graph models have been proposed. However, real-world networks ar…