default search action
Bulletin of the EATCS, Volume 64
Volume 64, February 1998
- Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Recent Advances Towards Proving P = BPP. Bull. EATCS 64 (1998)
- Egon Börger, James K. Huggins:
Abstract State Machines 1988-1998: Commented ASM Bibliography. Bull. EATCS 64 (1998)
- Alasdair Urquhart:
The Complexity of Propositional Proofs. Bull. EATCS 64 (1998)
- Uwe Nestmann, Björn Victor:
Calculi for Mobile Processes - Bibliography and Web Pages. Bull. EATCS 64 (1998)
- Juha Honkala:
On Slender Languages. Bull. EATCS 64 (1998)
- Amir M. Ben-Amram:
Introducing: Reasonable Complete Programming Languages. Bull. EATCS 64 (1998) - Vladik Kreinovich, Luc Longpré:
Human Visual Perception and Kolmogorov Complexity: Revisited. Bull. EATCS 64 (1998) - Carlos Martín-Vide, Alexandru Mateescu, Gheorghe Paun:
Hybrid Grammars: The Chomsky-Marcus Case. Bull. EATCS 64 (1998) - Ioan Tomescu:
A Threshold Property Concerning Words Containing All Short Factors. Bull. EATCS 64 (1998)
- Nadia Pisanti:
DNA Computing: A Survey. Bull. EATCS 64: 188-216 (1998)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.