default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Control, Volume 69
Volume 69, Number 1-3, 1986
- Steven Homer
, John H. Reif:
Arithmetic Theories for Computational Complexity Problems. 1-11 - Robert P. Daley, Carl H. Smith:
On the Complexity of Inductive Inference. 12-40 - Gilberto Filé:
Machines for Attribute Grammars. 41-124 - Stathis Zachos, Hans Heller:
A Decisive Characterization of BPP. 125-135 - Grzegorz Rozenberg, Emo Welzl:
Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity. 136-167 - Mikhail J. Atallah, Susanne E. Hambrusch:
Solving Tree Problems on a Mesh-Connected Processor Array. 168-187 - Pierre-Louis Curien:
Categorical Combinators. 188-254 - Joel I. Seiferas:
A Simplified Lower Bound for Context-Free-Language Recognition. 255-260
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-10-29 01:40 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:
