default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 190
Volume 190, Number 1, 10 April 2004
- Johannes Köbler, Rainer Schuler:
Average-case intractability vs. worst-case intractability. 1-17 - H. C. M. Kleijn, Maciej Koutny:
Process semantics of general inhibitor nets. 18-69 - Juha Honkala:
Bounds for the D0L language equivalence problem. 70-80 - Sanjay Jain, Wolfram Menzel, Frank Stephan
:
Classes with easily learnable subclasses. 81-99 - Amihood Amir, Kenneth Ward Church, Emanuel Dar:
The submatrices character count problem: an efficient solution using separable values. 100-116
Volume 190, Number 2, 1 May 2004
- Hagit Attiya, Hadas Shachnai:
Tight bounds for FEC-based reliable multicast. 117-135 - Gian Luca Cattani, Peter Sewell:
Models for name-passing processes: interleaving and causal. 136-178 - Daowen Qiu:
Automata theory based on quantum logic: some characterizations. 179-195 - Sergei G. Vorobyov:
The most nonelementary theory. 196-219 - Nadia Creignou, Hervé Daudé:
Combinatorial sharpness criterion and phase transition classification for random CSPs. 220-238
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 2025-12-09 23:25 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:
