Alfredo von Reckow

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In order to prove that the P class of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem [1], [3]. It is shown that, for every search algorithm A, there is a set E(A) containing propositional calculus formulae, each of which requires the algorithm A to take a(More)
  • 1