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

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

Authors: 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

• Arithmetic branching programs with memory
• Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
• Arithmetic circuits: a survey of recent results and open questions
• Title not available (Why is that?)
• Dichotomy theorems for homomorphism polynomials of graph classes
• Title not available (Why is that?)
• Homomorphism polynomials complete for VP
• Variants of homomorphism polynomials complete for algebraic complexity classes
• 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

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