On equivalence between polynomial constructivity of Markov's principle and \(P=NP\)
From MaRDI portal
Publication:1920039
zbMath0845.03018MaRDI QIDQ1920039
Publication date: 19 August 1996
Published in: Siberian Advances in Mathematics (Search for Journal in Brave)
intuitionistic logicMarkov principlepolynomial computabilityconstructive selectionconstructivity of a formal theory
Complexity of computation (including implicit computational complexity) (03D15) Metamathematics of constructive systems (03F50)
Related Items (1)
This page was built for publication: On equivalence between polynomial constructivity of Markov's principle and \(P=NP\)