39 citations · 89 across the 17 of their papers we have counts for
Showing 2001Show all
2 papers · 1 filter
cs.CC2001★ 2 cited
An Average Case NP-Complete Graph Coloring Problem
Leonid A. Levin, Ramarathnam Venkatesan
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been prove…
cs.CC2001★ 39 cited
Complex Tilings
Bruno Durand, Leonid A. Levin, Alexander Shen
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of i…