The parallel complexity of Abelian permutation group problems
SIAM Journal on Computing
Fast computation of the Smith normal form of an integer matrix
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
The complexity of matrix rank and feasible systems of linear equations
Computational Complexity
Isolation, matching and counting uniform and nonuniform upper bounds
Journal of Computer and System Sciences
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
Abelian Permutation Group Problems and Logspace Counting Classes
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Canonizing hypergraphs under abelian group action
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
In this paper we first examine the computational complexity of the problem LCON defined as follows: given a matrix A and a column vector b over ℤ, determine if Ax=b is a feasible system of linear equations over ℤq. Here q is also given as part of the input by its prime factorization $q = p^{e_1}_{1}p^{e_2}_{2}p^{e_k}_{k}$, such that each $p^{e_i}_{i}$ is tiny (i.e. given in unary). In [MC87] an NC3 algorithm is given for this problem. We show that in fact the problem can be solved in randomized NC2. More precisely, we show that LCON is in the nonuniform class LGapL/poly. Combined with the hardness of LCON for LGapL, we have a fairly tight characterization of the complexity of LCON in terms of logspace counting classes. We prove the same upper bound results for the problem of testing feasibility of Ax=b over finite rings R with unity, where R is given as part of the input as a table.