15 citations · 32 across the 25 of their papers we have counts for
3 papers · 1 filter
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel +1
We study the problem of counting the number of homomorphisms from an input graph to a fixed (quantum) graph in any finite field of prime order . The sub…
Polymer Dynamics via Cliques: New Conditions for Approximations
Tobias Friedrich, Andreas Göbel, Martin S. Krejca +1
Abstract polymer models are systems of weighted objects, called polymers, equipped with an incompatibility relation. An important quantity associated with such models is the partit…
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
Thomas Bläsius, Tobias Friedrich, Andreas Göbel +2
Satisfiability is considered the canonical NP-complete problem and is used as a starting point for hardness reductions in theory, while in practice heuristic SAT solving algorithms…