1 paper · 2 filters
Eric Culf, Arthur Mehta
Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-fo…