Williamson, S. Gill
- On the difficulty of proving P equals NP in ZFC
2019/07/26 by S. Gill Williamson, Williamson, S. Gill · 1 voice
Computer Science · Mathematics · #Advanced Topology and Set Theory #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO