On the closures of monotone algebraic classes and variants of the determinant
From MaRDI portal
Publication:6164001
DOI10.1007/978-3-031-20624-5_37MaRDI QIDQ6164001
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://pure.itu.dk/portal/da/publications/c4d8747b-a1d9-47ed-9493-8a7e9a2feea8
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the power of algebraic branching programs of width two
- Relations between exact and approximate bilinear algorithms. Applications
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- A note on VNP-completeness and border complexity
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- Arithmetic Circuits: A survey of recent results and open questions
- Boundaries of VP and VNP
- On Algebraic Branching Programs of Small Width
- On the Power of Border of Depth-3 Arithmetic Circuits
- Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes
- Characterizing Valiant’s Algebraic Complexity Classes
This page was built for publication: On the closures of monotone algebraic classes and variants of the determinant
