default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation 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
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-22 02:19 CEST 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:
