Let be a boolean formula constructed from the boolean input variables x 1 , x 2

Question:

Let Φ be a boolean formula constructed from the boolean input variables x1, x2, . . . ,xk, negations (¬), ANDs (∧), ORs (∨), and parentheses. The formula Φ is a tautology if it evaluates to 1 for every assignment of 1 and 0 to the input variables. Define TAUTOLOGY as the language of boolean formulas that are tautologies. Show that TAUTOLOGY ∈ co-NP.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: