%mm6/8/99

% cj99-07--done

@Article{cj99-07-01,
  author =       "E. Allender and R. Beigel and U. Hertrampf and S.
                 Homer",
  title =        "Almost-Everywhere Complexity Hierarchies for
                 Nondeterministic Time",
  journal =      "Theoretical Computer Science",
  volume =       "115",
  pages =        "225--242",
  year =         "1993",
}

@Article{cj99-07-02,
  author =       "E. Allender and V. Gore",
  title =        "A Uniform Circuit Lower Bound for the Permanent",
  journal =      "SIAM Journal on Computing",
  volume =       "23",
  pages =        "1026--1049",
  year =         "1994",
}

@Article{cj99-07-03,
  author =       "D. A.~Mix Barrington",
  title =        "Bounded-Width Polynomial-Size Branching Programs
                 Recognize Exactly Those Languages in {NC}$^1$",
  journal =      "Journal of Computer and System Sciences",
  volume =       "38",
  pages =        "150--164",
  year =         "1989",
}

@Article{cj99-07-04,
  author =       "D. A. Mix Barrington and N. Immerman and H.
                 Straubing",
  title =        "On Uniformity within {NC}$^1$",
  journal =      "Journal of Computer and System Sciences",
  volume =       "41",
  pages =        "274--306",
  year =         "1990",
}

@Article{cj99-07-05,
  author =       "D. A. Mix Barrington and D. Th\'{e}rien",
  title =        "Finite Monoids and the Fine Structure of {NC}$^1$",
  journal =      "Journal of the ACM",
  volume =       "35",
  pages =        "941--952",
  year =         "1988",
}

@Article{cj99-07-06,
  author =       "R. Book and S. Greibach",
  title =        "Quasi-Realtime Languages",
  journal =      "Mathematical Systems Theory",
  volume =       "4",
  pages =        "97--111",
  year =         "1970",
}

@Article{cj99-07-07,
  author =       "M. Furst and J. Saxe and M. Sipser",
  title =        "Parity, Circuits, and the Polynomial-Time Hierarchy",
  journal =      "Mathematical Systems Theory",
  volume =       "17",
  pages =        "13--27",
  year =         "1984",
}

@Article{cj99-07-08,
  author =       "J. Gill",
  title =        "Computational Complexity of Probabilistic {Turing}
                 Machines",
  journal =      "SIAM Journal on Computing",
  volume =       "6",
  pages =        "675--695",
  year =         "1977",
}

@Article{cj99-07-09,
  author =       "F. Green and J. K{\"{o}}bler and K. Regan and T.
                 Schwentick and J. Tor\'{a}n",
  title =        "The Power of the Middle bit of a \#{P} Function",
  journal =      "Journal of Computer and System Sciences",
  volume =       "50",
  pages =        "456--467",
  year =         "1995",
}

@Article{cj99-07-10,
  author =       "I. Parberry and G. Schnitger",
  title =        "Parallel Computation with Threshold Functions",
  journal =      "Journal of Computer and System Sciences",
  volume =       "36",
  pages =        "278--302",
  year =         "1988",
}

@Article{cj99-07-11,
  author =       "A. A. Razborov",
  title =        "Lower bounds on the size of bounded depth networks
                 over a complete basis with logical addition",
  journal =      "Mathematicheskie Zametki",
  volume =       "41",
  pages =        "598--607",
  year =         "1987",
  note =         "English translation in {\em Mathematical Notes of the
                 Academy of Sciences of the USSR} 41.4:333-338.",
}

@Article{cj99-07-12,
  author =       "W. Ruzzo",
  title =        "On Uniform Circuit Complexity",
  journal =      "Journal of Computer and System Sciences",
  volume =       "21",
  pages =        "365--383",
  year =         "1981",
}

@Article{cj99-07-13,
  author =       "J. Seiferas and M. Fischer and A. Meyer",
  title =        "Separating Nondeterministic Time Complexity Classes",
  journal =      "Journal of the ACM",
  volume =       "25",
  pages =        "146--167",
  year =         "1978",
}

@Article{cj99-07-14,
  author =       "S. Toda",
  title =        "Simple Characterizations of {P}(\#{P}) and Complete
                 Problems",
  journal =      "Journal of Computer and System Sciences",
  volume =       "49",
  pages =        "1--17",
  year =         "1994",
}

@Article{cj99-07-15,
  author =       "J. Tor\'{a}n",
  title =        "Complexity Classes Defined by Counting Quantifiers",
  journal =      "Journal of the ACM",
  volume =       "38",
  pages =        "753--774",
  year =         "1991",
}

@Article{cj99-07-16,
  author =       "L. Valiant",
  title =        "The Complexity of Enumeration and Reliability
                 Problems",
  journal =      "SIAM Journal on Computing",
  volume =       "8",
  pages =        "410--421",
  year =         "1979",
}

@Article{cj99-07-17,
  author =       "K. W. Wagner",
  title =        "The Complexity of Combinatorial Problems with Succinct
                 Input Representation",
  journal =      "Acta Informatica",
  volume =       "23",
  pages =        "325--356",
  year =         "1986",
}

@Article{cj99-07-18,
  author =       "C. Wilson",
  title =        "Decomposing {NC} and {AC}",
  journal =      "SIAM Journal on Computing",
  volume =       "19",
  pages =        "384--396",
  year =         "1990",
}

@Article{cj99-07-19,
  author =       "S. \v{Z}\`{a}k",
  title =        "A {Turing} Machine Hierarchy",
  journal =      "Theoretical Computer Science",
  volume =       "26",
  pages =        "327--333",
  year =         "1983",
}

@Article{cj99-07-20,
  author =       "V. Zank\'{o}",
  title =        "\#{P}-completeness via Many-One Reductions",
  journal =      "International Journal of Foundations of Computer
                 Science",
  volume =       "2",
  pages =        "77--82",
  year =         "1991",
}

@Article{cj99-07-21,
  author =       "Herv{\'e} Caussinus and Pierre McKenzie and Denis Th\'{e}rien and Heribert Vollmer",
  title =        "Nondeterministic {$\mathit{NC}^1$} Computation",
  pages =        "200--212",
  journal =      "Journal of Computer and System Sciences",
  year =         "1998",
  volume =       "57",
}

@Article{cj99-07-22,
  author =       "A. Razborov and S. Rudich",
  title =        "Natural Proofs",
  journal =      "Journal of Computer and System Sciences",
  volume =       "55",
  pages =        "24--35",
  year =         "1997",
}

@Conference{cj99-07-23,
  author =       "R. Smolensky",
  title =        "Algebraic 
		Methods in the Theory of Lower Bounds for
                 {Boolean} Circuit Complexity",
  pages =        "77--82",
  booktitle =    "Proceedings of the Nineteenth ACM Symposium on the Theory of
                 Computing",
  year =         "1987",
  publisher =    "ACM Press",
  address =      "New York"
}

@Conference{cj99-07-24,
  author =       "A. C. Yao",
  title =        "Separating 
		the Polynomial-Time Hierarchy by Oracles",
  pages =        "1--10",
  booktitle =    "Proceedings of the Twenty-sixth IEEE 
		Symposium on Foundations of Computer
                 Science",
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, CA",
  year =         "1985",
}

@Book{cj99-07-25,
  author =       "J. H{\aa}stad",
  title =        "Computational Limitations for Small Depth Circuits",
  publisher =    "MIT Press",
  address =      "Cambridge",
  year =         "1987",
}

@InCollection{cj99-07-26,
  author =       "I. Parberry",
  title =        "A Primer on the Complexity Theory of Neural Networks",
  booktitle =    "Formal Techniques in Artificial Intelligence: A
                 Sourcebook",
  editor =       "R. Banerji",
  series =       "Studies in Computer Science and Artificial
                 Intelligence",
  volume =       "6",
  publisher =    "North-Holland",
  address =      "Amsterdam",
  year =         "1990",
  pages =        "217--268",
}

@Conference{cj99-07-27,
  author =       "K. Iwama and C. Iwamoto",
  title =        "Parallel 
		complexity hierarchies based on {PRAM}s and
                 {DLOGTIME}-Uniform circuits",
  pages =        "24--32",
  booktitle =    "Proceedings, Eleventh Annual IEEE Conference on
                 Computational Complexity",
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, CA",
  year =         "1996",
}

@Article{cj99-07-28,
  author =       "E. Allender and J. Balc\'{a}zar and N. Immerman",
  title =        "A first-order isomorphism theorem",
  journal =      "SIAM Journal on Computing",
  volume =       "26",
  pages =        "557--567",
  year =         "1997",
}

@Article{cj99-07-29,
  author =       "W. Paul and E. Prau\ss\ and R. Reischuk",
  title =        "On alternation",
  journal =      "Acta Informatica",
  volume =       "14",
  pages =        "243--255",
  year =         "1980",
}

@InCollection{cj99-07-30,
  author =       "E. Allender",
  editor =       "Jin-Yi Cai and Chak Kuen Wong",
  title =        "A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy",
  booktitle =    "Proceedings of the Second International 
		  Computing and Combinatorics Conference (COCOON '96)",
  series =       "Lecture Notes in Computer Science",
  volume =       "1090",
  pages =        "127--135",
  publisher =    "Springer Verlag",
  year =         "1996",
  address =      "Berlin"
}