Dagstuhl Seminar Complexity Theory: Current Research 1992

Klaus Ambos-Spies, Steven Homer, Uwe Schöning (Eds.): Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992. Cambridge University Press 1993, ISBN 0-521-44220-6

@proceedings{DBLP:conf/dagstuhl/1992complexity,
  editor    = {Klaus Ambos-Spies and
               Steven Homer and
               Uwe Sch{\"o}ning},
  title     = {Complexity Theory: Current Research, Dagstuhl Workshop, February
               2-8, 1992},
  booktitle = {Complexity Theory: Current Research},
  publisher = {Cambridge University Press},
  year      = {1993},
  isbn      = {0-521-44220-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf: Reductions to Sets of Low Information Content. 1-46
Jay Belanger, Jie Wang: On Average P vs. Average NP. 47-67
Ronald V. Book: Additional Queries and Algorithmically Random Languages. 69-82
Harry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. 83-99
Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc: Promise Problems and Guarded Access to Unambiguous Computation. 101-146
Anne Condon: The Complexity of Space Boundes Interactive Proof Systems. 147-189
Rodney G. Downey, Michael R. Fellows: Fixed Parameter Tractability and Completeness. 191-225
Martin Kummer: Degrees of Unsolvability in Abstract Complexity Theory. 227-243
Antoni Lozano, Jacobo Torán: On the Non-Uniform Complexity of the Graph Isomorphism Problem. 245-271
Christoph Meinel, Stephan Waack: Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs. 273-290
John Tromp, Peter van Emde Boas: Associative Storage Modification Machines. 291-313

Last update Tue May 22 04:50:54 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page