DocumentCode
2642178
Title
Computing permanents over fields of characteristic 3: where and why it becomes difficult
Author
Kogan, Grigory
Author_Institution
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
fYear
1996
fDate
14-16 Oct 1996
Firstpage
108
Lastpage
114
Abstract
In this paper we consider the complexity of computing permanents over fields of characteristic 3. We present a polynomial time algorithm for computing per(A) for a matrix A such that the rank rg(AAT-I)⩽1. On the other hand, we show that existence of a polynomial-time algorithm for computing per(A) for a matrix A such that rg(AAT-I)⩾2 implies NP=R. As a byproduct we obtain that computing per(A) for a matrix A such that rg(AAT-I)⩾2 is P(mod3) complete
Keywords
computational complexity; matrix algebra; complexity; fields of characteristic 3; matrix; permanents; polynomial time algorithm; polynomial-time algorithm; Complexity theory; Computer science; Internet; Linear algebra; Polynomials; Symmetric matrices; World Wide Web;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
Conference_Location
Burlington, VT
ISSN
0272-5428
Print_ISBN
0-8186-7594-2
Type
conf
DOI
10.1109/SFCS.1996.548469
Filename
548469
Link To Document