Glossary

Tree traversal in computer science pertains to visiting each node of a tree data structure exactly one time, also recognized as tree search or walking the tree.

Quantified Boolean Formula (QBF) adds variable quantification to propositional logic, utilizing universal (∀) and existential (∃) quantifiers besides logical connectives AND, OR, and NOT. QBFs define conditions for all or some variable values.

A Tensor Network is a mathematical tool for calculating, representing and simplifying high-dimensional data using matrix product states (MPS) and tensor train (TT) decompositions.