Learning generalized depth three arithmetic circuits in the non-degenerate case

DOI10.4230/LIPICS.APPROX/RANDOM.2022.21MaRDI QIDQ6591871zbMATH OpenFDO

Authors Vishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha

Publication date 22 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2022.21

zbMATH Keywords

arithemtic circuitsaverage-case learningcircuit reconstructiondepth 3 arithmetic circuitslearning algorithmslearning circuits

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(3)

• Testing equivalence to design polynomials
• Reconstruction of depth-4 multilinear circuits
• Faster \& deterministic FPT algorithm for worst-case tensor decomposition

This page was built for publication: Learning generalized depth three arithmetic circuits in the non-degenerate case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591871)