Advertisement

The Orbit Problem Is in the GapL Hierarchy

  • V. Arvind
  • T. C. Vijayaraghavan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5092)

Abstract

The Orbit problem is defined as follows: Given a matrix A εn×n and vectors x,y ∈ ℚ n , does there exist a non-negative integer i such that A i x = y. This problem was shown to be in deterministic polynomial time by Kannan and Lipton in [7]. In this paper we put the problem in the logspace counting hierarchy GapLH. We also show that the problem is hard for C=L.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allender, E., Beals, R., Ogihara, M.: The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Computational Complexity 8(2), 99–126 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Allender, E., Ogihara, M.: Relationships among PL, #L and the Determinant. RAIRO - Theoretical Informatics and Applications 30, 1–21 (1996)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Damm, C.: DET=L# L. Informatik-Preprint 8, Fachbereich Informatik der Humboldt-Universitat zu, Berlin (1991)Google Scholar
  4. 4.
    Hesse, W., Allender, E., Barrington, D.A.M.: Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication. Journal of Computer and System Sciences 65(4), 695–716 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Hoang, T.M., Thierauf, T.: The Complexity of the Characteristic and the Minimal Polynomial. Theoretical Computer Science 295(1-3), 205–222 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Hoang, T.M., Thierauf, T.: The Complexity of the Inertia and Some Closure Properties of Gapl. In: Proceedings of 20th IEEE Conference on Computational Complexity, pp. 28–37 (2005)Google Scholar
  7. 7.
    Kannan, R., Lipton, R.: Polynomial-Time Algorithm for the Orbit Problem. Journal of the ACM 33(4), 808–821 (1986)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Toda, S.: Counting Problems Computationally Equivalent to Computing the Determinant. Technical report 91-07, Department of Computer Science, University of Electro-Communications, Tokyo (1991)Google Scholar
  9. 9.
    Valiant, L.G.: Why is Boolean Complexity Theory Difficult? In: Proceedings of the London Mathematical Society symposium on Boolean function complexity, pp. 84–94. Cambridge University Press, New York (1992)Google Scholar
  10. 10.
    Vinay, V.: Counting Auxiliary Pushdown Automata and Semi-Unbounded Arithmetic Circuits. In: Proceedings of 6th Structure in Complexity Theory Conference (CCC 1991), pp. 270–284 (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • V. Arvind
    • 1
  • T. C. Vijayaraghavan
    • 2
  1. 1.The Institute of Mathematical SciencesChennaiIndia
  2. 2.Chennai Mathematical InstituteSiruseriIndia

Personalised recommendations