ODD3SAT = {4: is a 3CNF formula over n variables and has a satisf ying assignment in which every clause has an odd number of TRUE literals.} Prove that ODD3SAT e P.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Problem 7. Define the language:
ODD3SAT = {4: p is a 3CNF formula over n variables and has a satisf ying assignment
in which every clause has an odd number of TRUE literals.}
Prove that ODD3SAT e P.
To get started, instead of a boolean variable that is either TRUE or FALSE, think of x¡ as either 1 or 0.
A. How would you replace the logical expressions x, and x¡ V x¡ by equivalent arithmetic
expressions modulo 2?
B. Describe how to convert each clause of o into a linear equation modulo 2, so that a truth
assignment satisfies the clause if and only if the corresponding numerical values of the literals
satisfy the equation.
C. Describe how to convert the conjunction of clauses of into a system of linear equations such
that a truth assignment satisfies ø if and only if the corresponding numerical values
simultaneously satisfy all the linear equations.
D. Describe a polynomial time algorithm to solve the system of linear equations.
Transcribed Image Text:Problem 7. Define the language: ODD3SAT = {4: p is a 3CNF formula over n variables and has a satisf ying assignment in which every clause has an odd number of TRUE literals.} Prove that ODD3SAT e P. To get started, instead of a boolean variable that is either TRUE or FALSE, think of x¡ as either 1 or 0. A. How would you replace the logical expressions x, and x¡ V x¡ by equivalent arithmetic expressions modulo 2? B. Describe how to convert each clause of o into a linear equation modulo 2, so that a truth assignment satisfies the clause if and only if the corresponding numerical values of the literals satisfy the equation. C. Describe how to convert the conjunction of clauses of into a system of linear equations such that a truth assignment satisfies ø if and only if the corresponding numerical values simultaneously satisfy all the linear equations. D. Describe a polynomial time algorithm to solve the system of linear equations.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Knowledge Booster
Transitive relations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education