default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 147
Volume 147, Number 1, November 25, 1998
- Robert Nieuwenhuis
:
Decidability and Complexity Analysis by Basic Paramodulation. 1-21 - Luca Cabibbo:
The Expressive Power of Stratified Logic Programs with Value Invention. 22-56 - Michael Benedikt, Timothy Griffin, Leonid Libkin:
Verifiable Properties of Database Transactions. 57-88 - Nader H. Bshouty, Sally A. Goldman, H. David Mathias:
Noise-Tolerant Parallel Learning of Geometric Concepts. 89-110
Volume 147, Number 2, December 15, 1998
- Sebastian Maneth:
The Generating Power of Total Deterministic Tree Transducers. 111-144 - Clemens Lautemann, Thomas Schwentick, Iain A. Stewart:
Positive Versions of Polynomial Time. 145-170 - Maria Paola Bonacina, Jieh Hsiang:
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis. 171-208 - Stephen Ponzio:
The Combinatorics of Effective Resistances and Resistive Inverses. 209-223
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-01-06 01:45 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:
