20. MFCS 1995:
Prague,
Czech Republic
Jirí Wiedermann, Petr Hájek (Eds.):
Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings.
Lecture Notes in Computer Science 969 Springer 1995, ISBN 3-540-60246-1 BibTeX
@proceedings{DBLP:conf/mfcs/1995,
editor = {Jir\'{\i} Wiedermann and
Petr H{\'a}jek},
title = {Mathematical Foundations of Computer Science 1995, 20th International
Symposium, MFCS'95, Prague, Czech Republic, August 28 - September
1, 1995, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {969},
year = {1995},
isbn = {3-540-60246-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Papers
Structural Complexity Theory
Algorithms
Complexity Theory
- Peter Heusch:
The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
221-226 BibTeX
- Viggo Kann:
Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems.
227-236 BibTeX
- Hanno Lefmann, Petr Savický:
Some Typical Properties of Large AND/OR Boolean Formulas.
237-246 BibTeX
Graph Models of Computations
Lower Bounds
Formal Languages
Unification,
Rewriting,
Type Theory
Distributed Computation
Concurrency
Semantics
Model Checking
Formal Calculi
Copyright © Sat May 16 23:29:34 2009
by Michael Ley (ley@uni-trier.de)