Quantified Boolean Formulas (QBF) extend classical Boolean logic by incorporating quantifiers over Boolean variables, thereby enabling the expression of problems in the PSPACE complexity class. The ...

The first new development is a quantum algorithm for evaluating a Boolean formula consisting of AND and OR gates of size N in time O(root N). This provides quantum speedups for any problem that can be ...

Weighted Model counting (WMC) is a fundamental problem in computer science with a wide variety of applications in practice, ranging from neural network verification to network reliability. The current ...

Applicable Analysis and Discrete Mathematics, Vol. 10, No. 2 (October 2016), pp. 408-446 (39 pages) An associative Boolean tree is a plane rooted tree whose internal nodes are labelled by AND or OR ...