% The Chicago Journal of Theoretical Computer Science, Volume 1998, Article 1
% Bibliography

@InProceedings{cj98-01-01,
  author =       "M. Agrawal and T. Thierauf",
  title =        "The {B}oolean Isomorphism Problem",
  booktitle =    "37th Symposium on Foundation of Computer Science",
  publisher =    "IEEE Computer Society Press",
  address =      "New York",
  year =         "1996",
  pages =        "422--430",
}

@Article{cj98-01-02,
  author =       "W. Aiello and J. H{\aa}stad",
  title =        "Statistical Zero-Knowledge Languages Can Be Recognized
                 in Two Rounds",
  journal =      "Journal of Computer and System Sciences",
  volume =       "42",
  year =         "1991",
  pages =        "327--345",
}

@InProceedings{cj98-01-03,
  author =       "L. Babai",
  title =        "Trading Group Theory for Randomness",
  booktitle =    "17th ACM Symposium on Theory of Computing",
  publisher =    "ACM Press",
  address =      "New York",
  year =         "1985",
  pages =        "421--429",
}

@Book{cj98-01-04,
  author =       "J. Balc\'azar and J. D{\'\i}az and J. Gabarr\'o",
  title =        "Structural Complexity Theory~{I}",
  series =       "EATCS Monographs on Theoretical Computer Science",
  publisher =    "Springer-Verlag",
  address =      "Berlin",
  year =         "1988",
}

@Book{cj98-01-05,
  author =       "J. Balc\'azar and J. D{\'\i}az and J. Gabarr\'o",
  title =        "Structural Complexity Theory~{II}",
  series =       "EATCS Monographs on Theoretical Computer Science",
  publisher =    "Springer-Verlag",
  address =      "Berlin",
  year =         "1991",
}

@Book{cj98-01-06,
  author =       "E. Berlekamp",
  title =        "Algebraic Coding Theory",
  publisher =    "McGraw-Hill",
  address =      "New York",
  year =         "1968",
}

@Article{cj98-01-07,
  author =       "M. Blum and A. Chandra and M. Wegman",
  title =        "Equivalence of Free {B}oolean Graphs Can Be Decided
                 Probabilistically in Polynomial Time",
  journal =      "Information Processing Letters",
  volume =       "10",
  year =         "1980",
  pages =        "80--82",
}

@Article{cj98-01-08,
  author =       "R. Boppana and J. H{\aa}stad and S. Zachos",
  title =        "Does co-{NP} Have Short Interactive Proofs?",
  journal =      "Information Processing Letters",
  volume =       "25",
  year =         "1987",
  pages =        "27--32",
}

@TechReport{cj98-01-09,
  author =       "B. Borchert and D. Ranjan",
  title =        "The Subfunction Relations are
                 {$\Sigma_2^p$}-complete",
  institution =  "MPI Saarbr{\"u}cken",
  year =         "1993",
  number =       "MPI-I-93-121",
}

@TechReport{cj98-01-10,
  author =       "B. Borchert and D. Ranjan and F. Stephan",
  title =        "On the Computational Complexity of some Classical
                 Equivalence Relations on {B}oolean Functions",
  institution =  "Electronic Colloquium on Computational Complexity",
  address =      "http://www.eccc.uni-trier.de/eccc/",
  year =         "1996",
  number =       "TR96-033",
  notes =        "To appear in {\em Theory of Computing Systems\/}",
}

@Article{cj98-01-11,
  author =       "N. Bshouty and R. Cleve and R. Gavald{\`a} and S.\
                 Kannan and C. Tamon",
  title =        "Oracles and Queries That Are Sufficient for Exact
                 Learning",
  journal =      "Journal of Computer and System Sciences",
  volume =       "52",
  year =         "1996",
  pages =        "421--433",
}

@Article{cj98-01-12,
  author =       "P. Clote and E. Kranakis",
  title =        "Boolean Functions, Invariance Groups, and Parallel
                 Complexity",
  journal =      "SIAM Journal on Computing",
  volume =       "20",
  year =         "1991",
  pages =        "553--590",
}

@InProceedings{cj98-01-13,
  author =       "S. Fortune and J. Hopcroft and E. Schmidt",
  title =        "The Complexity of Equivalence and Containment for Free
                 Single Variable Program Schemes",
  booktitle =    "5th Annual International Colloquium on Automata,
                 Languages and Programming",
  series =       "Lecture Notes in Computer Science",
  volume =       "62",
  publisher =    "Springer-Verlag",
  address =      "Berlin",
  year =         "1978",
  pages =        "227--240",
}

@Article{cj98-01-14,
  author =       "L. Fortnow",
  title =        "The Complexity of Perfect Zero-Knowledge",
  journal =      "Advances in Computing Research",
  volume =       "5",
  year =         "1989",
  pages =        "327--343",
}

@Article{cj98-01-15,
  author =       "S. Goldwasser and S. Micali and C. Rackoff",
  title =        "The Knowledge Complexity of Interactive Proof
                 Systems",
  journal =      "SIAM Journal on Computing",
  volume =       "18",
  year =         "1989",
  pages =        "186--208",
}

@Article{cj98-01-16,
  author =       "O. Goldreich and S. Micali and A. Wigderson",
  title =        "Proofs that Yield Nothing But Their Validity or All
                 Languages in {NP} Have Zero-Knowledge Proof Systems",
  journal =      "Journal of the ACM",
  volume =       "38",
  year =         "1991",
  pages =        "691--729",
}

@Article{cj98-01-17,
  author =       "S. Goldwasser and M. Sipser",
  title =        "Private Coins Versus Public Coins in Interactive Proof
                 Systems",
  journal =      "Advances in Computing Research",
  volume =       "5",
  year =         "1989",
  pages =        "73--90",
}

@Book{cj98-01-18,
  author =       "J. Hopcroft and J. Ullman",
  title =        "Introduction to Automata Theory, Languages and
                 Computation",
  publisher =    "Addison-Wesley",
  year =         "1979",
  address =      "Reading, MA",
}

@Article{cj98-01-19,
  author =       "O. Ibarra and S. Moran",
  title =        "Probabilistic Algorithms for Deciding Equivalence of
                 Straight-Line Programs",
  journal =      "Journal of the ACM",
  volume =       "30",
  year =         "1983",
  pages =        "217--228",
}

@Article{cj98-01-20,
  author =       "U. Sch{\"o}ning",
  title =        "Graph Isomorphism Is in the Low Hierarchy",
  journal =      "Journal of Computer and System Sciences",
  volume =       "37",
  year =         "1988",
  pages =        "312--323",
}

@Article{cj98-01-21,
  author =       "U. Sch{\"o}ning",
  title =        "Probabilistic Complexity Classes and Lowness",
  journal =      "Journal of Computer and System Sciences",
  volume =       "39",
  year =         "1989",
  pages =        "84--100",
}

@Article{cj98-01-22,
  author =       "J. Schwartz",
  title =        "Fast Probabilistic Algorithms for Verification of
                 Polynomial Identities",
  journal =      "Journal of the ACM",
  volume =       "27",
  year =         "1980",
  pages =        "701--717",
}

@InProceedings{cj98-01-23,
  author =       "M. Sipser",
  title =        "A Complexity Theoretic Approach to Randomness",
  booktitle =    "15th ACM Symposium on Theory of Computing",
  publisher =    "ACM Press",
  address =      "New York",
  year =         "1983",
  pages =        "330--335",
}

@InProceedings{cj98-01-24,
  author =       "R. Zippel",
  title =        "Probabilistic Algorithms for Sparse Polynomials",
  booktitle =    "International Symposium on Symbolic and Algebraic
                 Computation",
  series =       "Lecture Notes in Computer Science",
  volume =       "72",
  publisher =    "Springer-Verlag",
  address =      "Berlin",
  year =         "1979",
  pages =        "216--226",
}