13 citations · 46 across the 31 of their papers we have counts for
Showing 2013 · cs.CCShow all
3 papers · 2 filters
cs.CC2013
The Computational Complexity of the Game of Set and its Theoretical Applications
Michael Lampis, Valia Mitsou
The game of SET is a popular card game in which the objective is to form Sets using cards from a special deck. In this paper we study single- and multi-round variations of this gam…
cs.CC2013
New Inapproximability Bounds for TSP
Marek Karpinski, Michael Lampis, Richard Schmied
In this paper, we study the approximability of the metric Traveling Salesman Problem (TSP) and prove new explicit inapproximability bounds for that problem. The best up to now know…
cs.CC2013★ 13 cited
Model Checking Lower Bounds for Simple Graphs
Michael Lampis
A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for C…