Branching programs with extended memory: new insights

DOI10.1007/978-3-031-92932-8_7MaRDI QIDQ6902205zbMATH OpenFDO

Authors Suryajith Chillara, Nithish Raja

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92932-8_7

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Arithmetic circuits: a survey of recent results and open questions
• Characterizing Valiant's algebraic complexity classes
• Completeness and reduction in algebraic complexity theory
• Computing Algebraic Formulas Using a Constant Number of Registers
• Fast Parallel Computation of Polynomials Using Few Processors
• Mathematical foundations of computer science 2013. 38th international symposium, MFCS 2013, Klosterneuburg, Austria, August 26--30, 2013. Proceedings
• Monotone classes beyond VNP
• Reducibility by algebraic projections

Cited in

(1)

• A new characterization of \textsf{VNP} via colored determinant

This page was built for publication: Branching programs with extended memory: new insights

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