% The Chicago Journal of Theoretical Computer Science, Volume 1997, Article 5
% Bibliography
@Conference{cj97-05-01,
author = "E. Allender and R. Beals and M. Ogihara",
title = "The Complexity of Matrix Rank and Feasible Systems of
Linear Equations",
booktitle = "Proceedings of the 28th ACM Symposium on Theory of
Computing",
year = "1996",
pages = "161--167",
publisher = "ACM",
address = "New York"
}
@Article{cj97-05-02,
author = "E. Allender and M. Ogihara",
title = "Relationships among {PL}, \#{L}, and the Determinant",
journal = "{RAIRO} Theoretical Information and Applications",
volume = "30",
pages = "1--21",
year = "1996"
}
@Article{cj97-05-03,
author = "C. {\`A}lvarez and B. Jenner",
title = "A Very Hard Log-space Counting Class",
journal = "Theoretical Computer Science",
volume = "107",
pages = "3--30",
year = "1993",
}
@Article{cj97-05-04,
author = "S. J. Berkowitz",
title = "On Computing the Determinant in Small Parallel Time
Using a Small Number of Processors",
journal = "Information Processing Letters",
volume = "18",
pages = "147--150",
year = "1984",
}
@Article{cj97-05-05,
author = "G. Buntrock and C. Damm and U. Hertrampf and C.
Meinel",
title = "Structure and Importance of Logspace {MOD}-classes",
journal = "Mathematical Systems Theory",
volume = "25",
pages = "223--237",
year = "1992",
}
@Article{cj97-05-06,
author = "L. Babai and L. Fortnow",
title = "Arithmetization: {A} New Method in Structural
Complexity Theory",
journal = "Computational Complexity",
volume = "1",
number = "1",
pages = "41--66",
year = "1991",
}
@Conference{cj97-05-07,
author = "A. L. Chistov",
title = "Fast Parallel Calculation of the Rank of Matrices over a Field of Arbitrary Characteristic",
booktitle = "Proceedings of the International Conference Foundations of Computation Theory",
series = "Lecture Notes in Computer Science",
volume = "199",
year = "1985",
pages = "63--69",
publisher = "Springer",
address = "Berlin"
}
@Article{cj97-05-08,
author = "S. Cook",
title = "A Taxonomy of Problems with Fast Parallel Algorithms",
journal = "Information and Control",
volume = "64",
pages = "2--22",
year = "1985",
}
@Article{cj97-05-09,
author = "L. Csanky",
title = "Fast Parallel Inversion Algorithm",
journal = "SIAM Journal of Computing",
volume = "5",
pages = "818--823",
year = "1976",
}
@TechReport{cj97-05-10,
author = "C. Damm",
title = "\mbox{DET=L\(^{({\rm \#L})}\)}",
institution = "Fachbereich Informatik der Humboldt--Universit{\"a}t
zu Berlin",
number = "Informatik-Preprint 8",
year = "1991",
}
@Conference{cj97-05-11,
author = "P. Dymond and W. Ruzzo",
title = "Parallel {RAM}s with Owned Global Memory and
Deterministic Context-free Language Recognition",
booktitle = "Proceedings of the 13th International Colloquium on Automata, Languages and Computing",
series = "Lecture Notes in Computer Science",
volume = "226",
year = "1986",
pages = "95--104",
publisher = "Springer",
address = "Berlin"
}
@Book{cj97-05-12,
author = "D. Fadeev and V. Fadeeva",
title = "Computational Methods in Linear Algebra",
publisher = "Freeman",
year = "1963",
address = "San Francisco, CA",
}
@Inproceedings{cj97-05-13,
author = "H. Fernau and Klaus-J{\"o}rn Lange and Klaus
Reinhardt",
title = "Advocating Ownership",
booktitle = "Proceedings of the 16th Foundations of software
technology and theoretical Computer Science",
series = "Lecture Notes in Computer Science",
volume = "1180",
year = "1996",
pages = "286--297",
month = dec,
editor = "V. Chandu and V. Vinay",
publisher = "Springer",
address = "Berlin"
}
@Article{cj97-05-14,
author = "N. Immerman and S. Landau",
title = "The Complexity of Iterated Multiplication",
journal = "Information and Control",
volume = "116",
number = "1",
pages = "103--116",
year = "1995"
}
@TechReport{cj97-05-15,
author = "M. Mahajan and V. Vinay",
title = "Determinant: Old Algorithms, New Insights",
institution = "The Institute of Mathematical Sciences",
address = "Madras, India",
number = "IMSc-TR97/08/34",
year = "1997",
}
@InProceedings{cj97-05-16,
author = "M. Mahajan and V. Vinay",
title = "A Combinatorial Algorithm for the Determinant",
booktitle = "Proceedings of the 8th Annual ACM-SIAM Symposium on
Discrete Algorithms",
year = "1997",
address = "New Orleans, USA",
month = "January",
pages = "730--738",
}
@Conference{cj97-05-17,
author = "N. Nisan",
title = "Lower Bounds for Non-Commutative Computation",
booktitle = "Proceedings of the 23rd Annual Symposium on Theory of
Computing",
year = "1991",
pages = "410--418",
publisher = "ACM",
address = "New York"
}
@Conference{cj97-05-18,
author = "K. Reinhardt and E. Allender",
title = "Making Nondeterminism Unambiguous",
booktitle = "Proceedings of the 38th {IEEE} Symposium on
Foundations of Computer Science",
year = "1997",
publisher = "IEEE",
address = "Los Alamitos, CA"
}
@Conference{cj97-05-19,
author = "P. Rossmanith",
title = "The Owner Concept for {PRAM}s",
booktitle = "Proceedings of the 8th Symposium on Theoretical Aspects
of Computer Science, STACS",
series = "Lecture Notes in Computer Science",
volume = "480",
year = "1991",
pages = "172--183",
publisher = "Springer",
address = "Berlin"
}
@Article{cj97-05-20,
author = "P. A. Samuelson",
title = "A Method of Determining Explicitly the Coefficients of
the Characteristic Polynomial",
journal = "Annals of Mathatical Statistics",
volume = "13",
pages = "424--429",
year = "1942",
}
@Article{cj97-05-21,
author = "H. Straubing",
title = "A Combinatorial Proof of the {C}ayley-{H}amilton
Theorem",
journal = "Discrete Mathematics",
volume = "43",
pages = "273--279",
year = "1983",
}
@Unpublished{cj97-05-22,
author = "S. Toda",
title = "Counting Problems Computationally Equivalent to the
Determinant",
note = "manuscript",
year = "1991",
}
@Article{cj97-05-23,
author = "S. Toda",
title = "Classes of Arithmetic Circuits Capturing the
Complexity of Computing the Determinant",
journal = "IEICE Transactions on Information and Systems",
volume = "E75-D",
pages = "116--124",
year = "1992",
}
@Article{cj97-05-24,
author = "L. G. Valiant",
title = "The Complexity of Computing the Permanent",
journal = "Theoretical Computer Science",
volume = "8",
pages = "189--201",
year = "1979",
}
@InCollection{cj97-05-25,
author = "L. G. Valiant",
title = "Why is {B}oolean Complexity Theory Difficult?",
booktitle = "Boolean Function Complexity",
publisher = "Cambridge University Press",
year = "1992",
editor = "M. S. Paterson",
note = "London Mathematical Society Lecture Notes Series 169",
}
@Article{cj97-05-26,
author = "H. Venkateswaran",
title = "Circuit Definitions of Nondeterministic Complexity
Classes",
journal = "SIAM Journal on Computing",
volume = "21",
pages = "655--670",
year = "1992",
}
@Conference{cj97-05-27,
author = "V. Vinay",
title = "Counting Auxiliary Pushdown Automata and
Semi-Unbounded Arithmetic Circuits",
booktitle = "Proceedings of the 6th Structure in Complexity Theory
Conference",
series = "Lecture Notes in Computer Science",
volume = "223",
year = "1991",
pages = "270--284",
publisher = "Springer",
address = "Berlin"
}
@PhdThesis{cj97-05-28,
author = "V. Vinay",
title = "\textup{Semi-unboundedness and complexity classes}",
school = "Indian Institute of Science, Bangalore",
year = "July 1991",
}
@Article{cj97-05-29,
author = "C. B. Wilson",
title = "Relativized {NC}",
journal = "Mathematical Systems Theory",
volume = "20",
pages = "13--29",
year = "1987",
}