← Search

Farhad Vadiee

2 accepted papers

2023

From Width-Based Model Checking to Width-Based Automated Theorem Proving

AAAI 2023technical

In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial properties on graphs. In this work, we introduce a general framework to convert a large class of width-base…

Cited by 4SourcePDFScholar
2021

Unitary Branching Programs: Learnability and Lower Bounds

ICML 2021spotlight

Bounded width branching programs are a formalism that can be used to capture the notion of non-uniform constant-space computation. In this work, we study a generalized version of bounded width branching programs where instructions are defined by unitary matrices of bounded dimension. We introduce a…