The Complexity of the Boolean Formula Value Problem
نویسنده
چکیده
We examine the complexity of the formula value problem for Boolean formulas, which is the following decision problem: Given a Boolean formula without variables, does it evaluate to true? We show that the complexity of this problem is determined by certain closure properties of the connectives allowed to build the formula, and achieve a complete classification: The formula value problem is either in LOGTIME, complete for one of the classes NLOGTIME, coNLOGTIME or NC, or equivalent to counting modulo 2 under very strict reductions.
منابع مشابه
CMPT 407 - Complexity Theory Lecture 5: SAT, coNP, Search-to-Decision, NTime Hierarchy
Proof. SAT is in NP (easy). To prove NP-hardness, we will show that Circuit-SAT is reducible to SAT. Let C be an arbitrary Boolean circuit with gates g1, . . . , gm, where g1, . . . , gn are input gates and gm is the output gate. For each gj, introduce a Boolean variable yj. For every i > n, define the Boolean formula gatei expressing that the value of yi is equal to the value of the gate gi. T...
متن کامل$2^3$ Quantified Boolean Formula Games and Their Complexities
Consider QBF, the Quantified Boolean Formula problem, as a combinatorial game ruleset. The problem is rephrased as determining the winner of the game where two opposing players take turns assigning values to boolean variables. In this paper, three common variations of games are applied to create seven new games: whether each player is restricted to where they may play, which values they may set...
متن کاملThe Boolean formula value problem is in ALOGTIME (Preliminary Version)
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula value problem is complete for alternating log time under deterministic log time reductions. Consequently, i...
متن کاملSolution-Graphs of Boolean Formulas and Isomorphism
The solution graph of a Boolean formula on n variables is the subgraph of the hypercube Hn induced by the satisfying assignments of the formula. The structure of solution graphs has been the object of much research in recent years since it is important for the performance of SAT-solving procedures based on local search. Several authors have studied connectivity problems in such graphs focusing ...
متن کاملAlgorithms for Random 3-SAT
This classic problem in complexity theory is concerned with efficiently finding a satisfying assignment to a propositional formula. The input is a formula with n Boolean variables which is expressed as an AND of ORs with 3 variables in each OR clause (a 3-CNF formula). The goal is to (1) find an assignment of variables to TRUE and FALSE so that the formula has value TRUE, or (2) prove that no s...
متن کامل