It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Tur... more It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be "reduced" to the pro-blem of determining whether a given propositional formula is a tautology. Here "reduced" means, roughly speak-ing, that the first problem ...
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Tur... more It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be "reduced" to the pro-blem of determining whether a given propositional formula is a tautology. Here "reduced" means, roughly speak-ing, that the first problem ...
Uploads
Papers by Juan Carlos