default search action
Information and Computation, Volume 187
Volume 187, Number 1, 25 November 2003
- Peter V. Homeier, David F. Martin:
Secure mechanical verification of mutually recursive procedures. 1-19 - Lefteris M. Kirousis, Phokion G. Kolaitis:
The complexity of minimal satisfiability problems. 20-39 - Juhani Karhumäki, Leonid P. Lisovik:
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c. 40-48 - Jack H. Lutz:
The dimensions of individual strings and sequences. 49-79 - Dietrich Kuske:
Regular sets of infinite message sequence charts. 80-109 - Takashi Mihara:
Splitting information securely with entanglement. 110-122 - Hubert Comon, Florent Jacquemard:
Ground reducibility is EXPTIME-complete. 123-153
Volume 187, Number 2, 15 December 2003
- Michal Parnas, Dana Ron
:
Testing metric properties. 155-195 - Yoram Hirshfeld, Alexander Moshe Rabinovich
Future temporal logic needs infinitely many modalities. 196-208 - Gennaro Costagliola
On regular drawn symbolic picture languages. 209-245 - Israel Gottlieb, Bojana Obrenic:
Controlling the data space of tree structured computations. 246-276 - Nader H. Bshouty, Jeffrey C. Jackson
Uniform-distribution attribute noise learnability. 277-290 - Jörg Flum, Martin Grohe
Describing parameterized complexity classes. 291-319
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.
last updated on 2024-11-11 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: