The following pages link to (Q3002772):
Displaying 12 items.
- On constructive and well-behaved classes of algebraic \(\Sigma \Pi \)-algorithms (Q610602) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Learning matrix functions over rings (Q1271196) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
- Complexity of Equivalence and Learning for Multiplicity Tree Automata (Q2922034) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- (Q4451894) (← links)
- (Q5090938) (← links)
- Learning Theory and Kernel Machines (Q5305870) (← links)
- Arithmetic circuits, structured matrices and (not so) deep learning (Q6109070) (← links)
- Categories of Differentiable Polynomial Circuits for Machine Learning (Q6393524) (← links)