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

DOI10.1007/978-3-032-17156-6_10MaRDI QIDQ7307314zbMATH OpenFDO

Authors Prasad Chaugule

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• Arithmetic branching programs with memory
• Arithmetic circuits: a survey of recent results and open questions
• Branching programs with extended memory: new insights
• scientific article; zbMATH DE number 1332669 (Why is no real title available?)
• On the closures of monotone algebraic classes and variants of the determinant
• Variants of the determinant polynomial and the \textsf{VP}-completeness

This page was built for publication: A new characterization of \textsf{VNP} via colored determinant

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