On the Expressive Power of Read-Once Determinants

DOI10.1007/978-3-319-22177-9_8zbMath1380.68455arXiv1508.06511OpenAlexW1941738311MaRDI QIDQ2947872

Pushkar S. Joglekar, N. R. Aravind

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.06511

Mathematics Subject Classification ID

Related Items (1)

On the complexity of the permanent in various computational models

Cites Work

• Unnamed Item
• Unnamed Item
• Feasible arithmetic computations: Valiant's hypothesis
• Lower bounds on arithmetic circuits via partial derivatives
• Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
• An algebraic matching algorithm
• Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
• Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
• Some Exact Complexity Results for Straight-Line Computations over Semirings
• Deterministic Polynomial Time Algorithms for Matrix Completion Problems
• Depth-3 arithmetic circuits over fields of characteristic zero

This page was built for publication: On the Expressive Power of Read-Once Determinants