Unitary Branching Programs: Learnability and Lower Bounds
Fidel Ernesto Daz Andino 1 Maria Kokkou 2 Mateus de Oliveira Oliveira 3 Farhad Vadiee 3
Abstract depth Boolean circuits can be computed by width-5 branch-
ing programs of polynomial length.
Bounded width branching programs are a for-
malism that can be used to capture the notion The problem of constructing branching programs consis-
of non-u ...


雷达卡




京公网安备 11010802022788号







