Fetching the paper…
Reading the bibliography…
We consider the problems of determining the feasibility of a linear congruence, producing a solution to a linear congruence, and finding a spanning set for the nullspace of an integer matrix, where each problem is considered modulo an arbitrary constant k>1.
Theoretical Computer Science
L. G. Valiant · 1979
Earlier work this paper cites.
In 23rd Annual Symposium on Foundations of Computer Science
A. Borodin, J. von zur Gathen, and J. Hopcroft · 1982
Earlier work this paper cites.
Information Processing Letters
S. J. Berkowitz · 1984
Earlier work this paper cites.
Journal of Computer and System Sciences
Walter L. Ruzzo, Janos Simon, and Martin Tompa · 1984
Earlier work this paper cites.
SIAM Journal of Computing
P. McKenzie and S. Cook · 1987
Earlier work this paper cites.
Combinatorica
K. Mulmuley · 1987
Cited alongside, same era.
In Proc. STACS 90, Lecture Notes in Computer Science
R. Beigel, J. Gill, and U. Hertrampf · 1990
Cited alongside, same era.
Theory of Computing Systems
G. Buntrock, C. Damm, U. Hertrampf, and C. Meinel · 1992
Cited alongside, same era.
In RAIRO — Theor. Inform. Appl.,
E. Allender and M. Ogihara · 1996
Cited alongside, same era.
Mathematical Systems Theory
J. Köbler and S. Toda · 1996
Cited alongside, same era.
Comp. Complexity
E. Allender, R. Beals, and M. Ogihara · 1999
Later among the works it cites.
http://people.cs.uchicago.edu/ ∼ \sim robert/papers/mod-log.ps , 1999
R. Szelepcsényi · 1999
Later among the works it cites.
Information Processing Letters
U. Hertrampf, S. Reith, and H. Vollmer · 2000
Later among the works it cites.
Computational Complexity
V. Arvind and T. C. Vijayaraghavan · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…