


default search action
Information and Computation, Volume 91
Volume 91, Number 1, 1991
- Matthias Krause:

Lower Bounds for Depth-Restricted Branching Programs. 1-14 - Nicole Bidoit, Christine Froidevaux:

General Logical Databases and Programs: Default Logic Semantics and Stratification. 15-54 - Roberto M. Amadio:

Recursion over Realizability Structures. 55-85 - Samuel R. Buss, Louise Hay:

On Truth-Table Reducibility to SAT. 86-102 - Kirk Pruhs, Udi Manber:

The Complexity of Controlled Selection. 103-127 - Dan Geiger, Azaria Paz, Judea Pearl:

Axioms and Algorithms for Inferences Involving Probabilistic Independence. 128-141 - Joachim von zur Gathen, Gadiel Seroussi:

Boolean Circuits Versus Arithmetic Circuits. 142-154
Volume 91, Number 2, 1991
- P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal:

Approximate Algorithms for the Knapsack Problem on Parallel Computers. 155-171 - Lajos Rónyai:

Computing the Order of Centralizers in Linear Groups. 172-176 - Marek Chrobak, Howard J. Karloff, Tomasz Radzik:

Connectivity vs. Reachability. 177-188 - N. G. de Bruijn:

Telescopic Mappings in Typed Lambda Calculus. 189-204 - Brian A. Coan, Cynthia Dwork:

Simultaneity Is Harder than Agreement. 205-231 - Kim Guldstrand Larsen, Glynn Winskel:

Using Information Systems to Solve Recursive Domain Equations. 232-258 - Stephen J. Bellatoni:

Parallel Random Access Machines with Bounded Memory Wordsize. 259-273

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














