Chicago Journal of Theoretical Computer Science, 1999

Volume 1999, 1999

• Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán:
  On Finding the Number of Graph Automorphisms.
  
• Jie Wang:
  Randomized Reductions and Isomorphisms.
  
• Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
  Complements of Multivalued Functions.
  
• Christoph Karg, Johannes Köbler, Rainer Schuler:
  The Complexity of Generating Test Instances.
  
• Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan:
  The Complexity of Problems on Graphs Represented as OBDDs.
  
• Arun K. Jagota:
  Hopfield Neural Networks and Self-Stabilization.
  
• Eric Allender:
  The Permanent Requires Large Uniform Threshold Circuits.
  
• Jeff Erickson:
  Bounds for Linear Satisfiability Problems.
  
• Martha J. Kosa:
  Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types.
  
• Zeev Collin, Rina Dechter, Shmuel Katz:
  Self-Stabilizing Distributed Constraint Satisfaction.
  
• Ramamohan Paturi, Pavel Pudlák, Francis Zane:
  Satisfiability Coding Lemma.