A Solution of the P versus NP ProblemarXiv:1708.03486v1[cs.CC]11Aug2017 A Solution of the P versus NP Problem Norbert Blum Institut f¨ur Informatik, Universit¨at Bonn Friedrich-Ebert-Allee 144, D-53113 Bonn, Germany email: blum@cs.uni-bonn.de August 14, 2017 Abstract Berg and Ulfberg [4] and Amano and Maruoka [2] have used CNF- DNF-approximators to prove exponential lower bounds for the mono- tone network complexity of the clique fu
