The Orbit Problem Is in the GapL Hierarchy

摘要：

The Orbit problem is defined as follows: Given a matrix A 6 Qn×n and vectors x,y ∈ Qn, does there exist a non-negative integer i such that Aix=y. This problem was shown to be in deterministic polynomial

作者: V. Arvind T.C. Vijayaraghavan

作者单位: The Institute of Mathematical Sciences, Chennai 600 113, India Chennai Mathematical Institute, SIPCOT IT Park Padur PO,Siruseri 603 103, India

会议类型: 国际会议

会议名称: The 4th Annual International Computing and Combinatorics Conference,COCOON 2008(第14届国际计算和组合会议)

会议地点: 大连

会议语种:英文

页码: 160-169

在线出版日期: 2008-06-01（万方平台首次上网日期，不代表论文的发表时间）