Information 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
  

Last update Tue Feb 14 04:18:16 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page