Bergé, Pierre
- Deciding twin-width at most 4 is NP-complete
2021/12/16 by Bergé, Pierre, Bonnet, Édouard, Déprés, Hugues · 3 citations
#68Q17 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics