Variants of the determinant polynomial and the \textsf{VP}-completeness

DOI10.1007/978-3-030-79416-3_3OpenAlexW3176977390MaRDI QIDQ2117074

Prasad Chaugule, Nutan Limaye, Shourya Pandey

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_3

zbMATH Keywords

algebraic circuits\textsf{VP}-completenessdeterminant family

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Some complete and intermediate polynomials in algebraic complexity theory
• Variants of homomorphism polynomials complete for algebraic complexity classes
• Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
• Arithmetic Branching Programs with Memory
• Homomorphism Polynomials Complete for VP
• Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
• Arithmetic Circuits: A survey of recent results and open questions
• On Hardness of Multilinearization and VNP-Completeness in Characteristic 2

This page was built for publication: Variants of the determinant polynomial and the \textsf{VP}-completeness