Information and Computation, Volume 153

Volume 153, Number 1, August 1999

• Anna Bernasconi, Lavinia Egidi:
  Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions. 1-25
  
• Wolfgang Maass, Michael Schmitt:
  On the Complexity of Learning for Spiking Neurons with Temporal Coding. 26-46
  
• Manfred Droste, Paul Gastin:
  The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables. 47-80
  
• Sergio Greco, Domenico Saccà:
  Complexity and Expressive Power of Deterministic Semantics for DATALOG¬. 81-98
  
• Alexei P. Stolboushkin, Michael A. Taitslin:
  Finite Queries Do Not Have Effective Syntax. 99-116
  
• Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
  The Power of Multiobjects. 117-138
  

Volume 153, Number 2, September 1999

• James I. Lathrop, Jack H. Lutz:
  Recursive Computational Depth. 139-172
  
• Paolo Baldan, Giorgio Ghelli, Alessandra Raffaetà:
  Basic Theory of F-Bounded Quantification. 173-237
  
• Sanjay Jain:
  Robust Behaviorally Correct Learning. 238-248
  

Last update Sat May 18 16:23:26 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page