Madelaine, Florent

1. A universal-algebraic proof of the complexity dichotomy for Monotone\n Monadic SNP
   2018/02/09 by Manuel Bodirsky, Bodirsky, Manuel, Florent Madelaine +3 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge