Complexity Theory: Current Research

Keyphrases

Publications

1993

Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992 Complexity Theory: Current Research (1993)

1992

Christoph Meinel, Stephan Waack
Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs. Complexity Theory: Current Research (1992)
Harry Buhrman, Edith Spaan, Leen Torenvliet
Bounded Reductions. Complexity Theory: Current Research (1992)
Jay Belanger, Jie Wang
On Average P vs. Average NP. Complexity Theory: Current Research (1992)
Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc
Promise Problems and Guarded Access to Unambiguous Computation. Complexity Theory: Current Research (1992)
Antoni Lozano, Jacobo Torán
On the Non-Uniform Complexity of the Graph Isomorphism Problem. Complexity Theory: Current Research (1992)
Ronald V. Book
Additional Queries and Algorithmically Random Languages. Complexity Theory: Current Research (1992)
Anne Condon
The Complexity of Space Boundes Interactive Proof Systems. Complexity Theory: Current Research (1992)
John Tromp, Peter van Emde Boas
Associative Storage Modification Machines. Complexity Theory: Current Research (1992)
Martin Kummer
Degrees of Unsolvability in Abstract Complexity Theory. Complexity Theory: Current Research (1992)
Rodney G. Downey, Michael R. Fellows
Fixed Parameter Tractability and Completeness. Complexity Theory: Current Research (1992)
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. Complexity Theory: Current Research (1992)