Mathematical foundations of computer science 1995. 20th international symposium, MFCS '95, Prague, Czech Republic, August 28-September 1, 1995. Proceedings
type: Item
instance of: scholarly article
title: Mathematical foundations of computer science 1995. 20th international symposium, MFCS '95, Prague, Czech Republic, August 28-September 1, 1995. Proceedings
zbMATH Open document ID: 0847.00052
DOI: 10.1007/3-540-60246-1
published in: Lecture Notes in Computer Science
publication date: 1995-10-16T00:00:00Z
review text: The articles of this volume will be reviewed individually. The 15th international symposium (1990) has been reviewed (see Zbl 0776.00038). Indexed articles: \textit{Adler, Micah; Byers, John W.; Karp, Richard M.}, Scheduling parallel communication: The \(h\)-relation problem, 1-20 [Zbl 1193.68054] \textit{Arnborg, Stefan}, Decomposable structures, Boolean function representations, and optimization, 21-36 [Zbl 1193.68184] \textit{Flammini, Michele; van Leeuwen, Jan; Marchetti-Spaccamela, Alberto}, The complexity of interval routing on random graphs, 37-49 [Zbl 1193.68189] \textit{Geffert, Viliam}, Bridging across the \(\log (n)\) space frontier, 50-65 [Zbl 1193.68114] \textit{Gottlob, Georg; Leone, Nicola; Veith, Helmut}, Second order logic and the weak exponential hierarchies, 66-81 [Zbl 1193.68115] \textit{Hartmanis, Juris}, On the computing paradigm and computational complexity, 82-92 [Zbl 1193.68116] \textit{Perrin, Dominique}, Symbolic dynamics and finite automata, 94-104 [Zbl 1193.68157] \textit{Vitányi, Paul}, Physics and the new computation, 106-128 [Zbl 1193.68110] \textit{Allender, Eric; Strauss, Martin}, Measure on P: Robustness of the notion, 129-138 [Zbl 1193.68111] \textit{Burtschick, Hans-Jörg}, Comparing counting classes for logspace, one-way logspace, and first-order, 139-148 [Zbl 1193.68113] \textit{Damm, Carsten; Holzer, Markus}, Automata that take advice, 149-158 [Zbl 1193.68152] \textit{Homer, Steven; Mocas, Sarah}, Nonuniform lower bounds for exponential time classes, 159-168 [Zbl 1188.68145] \textit{Kaufmann, Susanne; Kummer, Martin}, On a quantitative notion of uniformity, 169-178 [Zbl 1193.68117] \textit{Merkle, Wolfgang; Wang, Yongge}, Separations by random oracles and ``almost'' classes for generalized reducibilities, 179-190 [Zbl 1193.03071] \textit{Beauquier, Danièle; Burago, Dima; Slissenko, Anatol}, On the complexity of finite memory policies for Markov decision processes, 191-200 [Zbl 1193.68126] \textit{Hofmeister, Thomas; Lefmann, Ha…
Mathematics Subject Classification ID: 00B25
Mathematics Subject Classification ID: 68-06
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 805919
zbMATH Keywords: Computer science
zbMATH Keywords: Symposium
zbMATH Keywords: Proceedings
zbMATH Keywords: Prague (Czech Republic)
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/3-540-60246-1
OpenAlex ID: W2615186128
description: scientific article; zbMATH DE number 805919