Volume 110, Number 1, 1994
- Jonathan Sorenson:
Polylog Depth Circuits for Integer Factoring and Discrete Logarithms.
1-18 BibTeX
- Peter Thanisch, George Loizou, Jyrki Nummenmaa:
Finding Compact Scheme Forests in Nested Normal Form is NP-Hard.
19-41 BibTeX
- Raymond T. Ng, V. S. Subrahmanian:
Stable Semantics for Probabilistic Deductive Databases.
42-83 BibTeX
- Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi:
On Learning Monotone DNF Formulae under Uniform Distributions.
84-95 BibTeX
- Jerry L. Trahan, Vijaya Ramachandran, Michael C. Loui:
Parallel Random Access Machines with both Multiplication and Shifts.
96-118 BibTeX
- Steven Homer, Jie Wang:
Immunity of Complete Problems.
119-129 BibTeX
- Marc J. van Kreveld, Mark H. Overmars:
Concatenable Structures for Decomposable Problems.
130-148 BibTeX
- Bernhard Steffen, Anna Ingólfsdóttir:
Characteristic Formulae for Processes with Divergence.
149-163 BibTeX
- Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On Confluent Semi-commutations: Decidability and Complexity Results.
164-182 BibTeX
- Hagit Attiya, Nancy A. Lynch:
Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty.
183-232 BibTeX
- Guo-Qiang Zhang:
A Representation of SFP.
233-263 BibTeX
Volume 110, Number 2, 1994
Copyright © Wed Jun 4 19:10:17 2008
by Michael Ley (ley@uni-trier.de)
