default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 192
Volume 192, Number 1, 1 July 2004
- Pavol Duris:
Multiparty communication complexity and very hard functions. 1-14 - John Case, Efim B. Kinber, Arun Sharma
, Frank Stephan:
On the classification of recursive languages. 15-40 - Christian Cachin:
An information-theoretic model for steganography. 41-56 - Pierre B. A. Lecomte, Michel Rigo:
Real numbers having ultimately periodic representations in abstract numeration systems. 57-83 - Marc Denecker, Victor W. Marek, Miroslaw Truszczynski:
Ultimate approximation and its application in nonmonotonic knowledge representation systems. 84-121
Volume 192, Number 2, 1 August 2004
- John A. Ellis, Minko Markov:
Computing the vertex separation of unicyclic graphs. 123-161 - Richard Cleve:
The query complexity of order-finding. 162-171 - Mark-Jan Nederhof, Giorgio Satta:
The language intersection problem for non-recursive context-free grammars. 172-184 - Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
Learning all subfunctions of a function. 185-215
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-20 23:48 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:
