A Lower Bound for the Determinantal Complexity of a Hypersurface-Reference-Cited by-同舟云学术

A Lower Bound for the Determinantal Complexity of a Hypersurface

Published:2015-11-19 Issue:3 Volume:17 Page:829-836
ISSN:1615-3375
Container-title:Foundations of Computational Mathematics
language:en
Short-container-title:Found Comput Math

Author:

Alper Jarod,Bogart Tristram,Velasco Mauricio

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis

Link

http://link.springer.com/content/pdf/10.1007/s10208-015-9300-x.pdf

Reference16 articles.

1. Leslie G. Valiant. Completeness classes in algebra. In Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing (Atlanta, Ga.), pages 249–261. 1979.

2. Leslie G. Valiant. The complexity of computing the permanent. Theoret. Comput. Sci., 8(2):189–201, 1979.

3. Thierry Mignon and Nicolas Ressayre. A quadratic bound for the determinant and permanent problem. Int. Math. Res. Not., (79):4241–4253, 2004.

4. Jin-Yi Cai, Xi Chen, and Dong Li. A quadratic lower bound for the permanent and determinant problem over any characteristic $$\ne 2$$ ≠ 2 . In STOC’08, pages 491–497. ACM, New York, 2008.

5. Bruno Grenet. An Upper Bound for the Permanent versus Determinant Problem. to appear in Theory of Computing, 2011.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Determinants vs. Algebraic Branching Programs;computational complexity;2024-08-31

2. A Lower Bound on Determinantal Complexity;computational complexity;2022-09-19

3. No occurrence obstructions in geometric complexity theory;Journal of the American Mathematical Society;2018-10-04

4. On the complexity of the permanent in various computational models;Journal of Pure and Applied Algebra;2017-12

5. Permanent v. determinant: An exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture;Differential Geometry and its Applications;2017-12