


default search action
Information and Control, Volume 70
Volume 70, Number 1, 1986
- Paolo Atzeni
, Nicola M. Morfuni:
Functional Dependencies and Constraints on Null Values in Database Relations. 1-31 - Richard Cole, Uzi Vishkin:
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. 32-53 - Pekka Orponen
, Uwe Schöning:
The Density and Complexity of Polynomial Cores for Intractable Sets. 54-68 - Daniel N. Osherson, Michael Stob, Scott Weinstein:
Aggregating Inductive Expertise. 69-95
Volume 70, Number 2-3, 1986
- Sergiu Hart
, Micha Sharir:
Probabilistic Propositional Temporal Logics. 97-155 - James S. Royer:
Inductive Inference of Approximations. 156-178 - Etsuro Moriya, Shigeki Iwata, Takumi Kasai:
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines. 179-185 - Péter Gács:
Every Sequence Is Reducible to a Random One. 186-192 - Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer:
Pre-analysis Locking. 193-215 - Larry Denenberg, Yuri Gurevich, Saharon Shelah
:
Definability by Constant-Depth Polynomial-Size Circuits. 216-240

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.