Mathematical Systems Theory, Volume 24
Volume 24, Number 1, 1991
Osamu Watanabe: On Intractability of the Class UP. 1-10- Zevi Miller, Ivan Hal Sudborough: A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. 11-40
- Juraj Hromkovic: On Problems for Which no Oracle Can Help. 41-52
- Eric Allender: Limitations of the Upward Separation Technique. 53-67
Volume 24, Number 2, 1991
- Seinosuke Toda: On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets. 68-82
- Ian Parberry: A Computer-Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks. 101-116
- Bruno Courcelle, Damian Niwinski, Andreas Podelski: A Geometrical View of the Determinization and Minimization of Finite-State Automata. 117-146
Volume 24, Number 3, 1991
- William Slough, Karl Winklmann: On Limitations of Transformations Between Combinatorial Problems. 149-168
- James Haralambides, Fillia Makedon, Burkhard Monien: Bandwidth Minimization: An Approximation Algorithm for Caterpillars. 169-177
- Harry Buhrman, Steven Homer, Leen Torenvliet: Completeness for Nondeterministic Complexity Classes. 179-200
Volume 24, Number 4, 1991
- Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas: Tight Bounds for Oblivious Routing in the Hypercube. 223-232
- Marc Baumslag, Fred S. Annexstein: A Unified Framework for Off-Line Permutation Routing in Parallel Networks. 233-251
- William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman: Fast Algorithms for Bit-Serial Routing on a Hypercube. 253-271
- Yuh-Dauh Lyuu: Fast Fault-Tolerant Parallel Communication and On-Line Maintenance for Hypercubes Using Information Dispersal. 273-294
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203403 by the dblp team