Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS' 98, Brno, Czech Republic, August 24-28, 1998 > Reducing AC-termination to termination
Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS' 98, Brno, Czech Republic, August 24-28, 1998 |
Luboš Brim; Jozef Gruska; Jiří Zlatuška
Springer Berlin Heidelberg
Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS' 98, Brno, Czech Republic, August 24-28, 1998
Reducing AC-termination to termination
Authors

Maria C. F. Ferreira; Delia Kesner; Laurence Puel

ARI Id

1674219647807_1737336

Access

Open/Free Access

Pages

239-247

DOI

10.1007/BFb0055773

Chapter URL

https://rd.springer.com/chapter/10.1007/BFb0055773

Table of Contents of Book
Showing 1 to 20 of 84 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Hypergraph traversal revisited: Cost measures and dynamic algorithms
Giorgio Ausiello; Giuseppe F. Italiano; Umberto Nanni
1-16
Defining the Java Virtual Machine as platform for provably correct Java compilation
Egon Börger; Wolfram Schulte
17-35
Towards a theory of recursive structures
David Harel
36-53
Modularization and abstraction: The keys to practical formal verification
Yonit Kesten; Amir Pnueli
54-71
On the role of time and space in neural computation
Wolfgang Maass
72-83
From algorithms to working programs: On the use of program checking in LEDA
Kurt Mehlhorn; Stefan Näher
84-93
Computationally-sound checkers
Silvio Micali
94-116
Reasoning about the past
Mogens Nielsen
117-128
Satisfiability — Algorithms and logic
Pavel Pudlák
129-141
The joys of bisimulation
Colin Stirling
142-151
Towards algorithmic explanation of mind evolution and functioning
Jiří Wiedermann
152-166
Combinatorial hardness proofs for polynomial evaluation
Mikel Aldaz; Joos Heintz; Guillermo Matera; José L. Montaña; Luis M. Pardo
167-175
Minimum propositional proof length is NP-hard to linearly approximate
Michael Alekhnovich; Sam Buss; Shlomo Moran; Toniann Pitassi
176-184
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
Marek Chrobak; Christoph Dürr
185-193
Locally explicit construction of rődl's asymptotically good packings
Nikolai N. Kuzjurin
194-202
Proof theory of fuzzy logics: Urquhart's C and related logics
Matthias Baaz; Agata Ciabattoni; Christian Fermüller; Helmut Veith
203-212
Nonstochastic languages as projections of 2-tape quasideterministic languages
Richard Bonner; Rūsiņš Freivalds; Jānis Lapiņš; Antra Lukjanska
213-219
Flow logic for Imperative Objects
Flemming Nielson; Hanne Riis Nielson
220-228
Expressive completeness of Temporal Logic of action
Alexander Rabinovich
229-238
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 84 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings