The orbit problem is in the GapL hierarchy
From MaRDI portal
Publication:626456
DOI10.1007/s10878-009-9243-8zbMath1298.65075OpenAlexW2030247721MaRDI QIDQ626456
T. C. Vijayaraghavan, V. Arvind
Publication date: 18 February 2011
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.634.6249
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of the characteristic and the minimal polynomial.
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- The complexity of matrix rank and feasible systems of linear equations
- Polynomial-time algorithm for the orbit problem
- The Orbit Problem Is in the GapL Hierarchy
- Relationships among $PL$, $\#L$, and the determinant
This page was built for publication: The orbit problem is in the GapL hierarchy
