activity
20162021
most citedUtilizing Network Structure to Bound the Convergence Rate in Markov Chain Monte Carlo Algorithms

1 citations · 1 across the 10 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2016

Roughly Polynomial Time: A Concept of Tractability Covering All Known Natural NP-complete Problems

Andras Farago

We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note th…