1985 |
10 | | Kenneth L. Manders:
Logic and conceptual relationships in mathematics.
Logic Colloquium 1985: 193-212 |
1982 |
9 | | Kenneth L. Manders,
Robert R. Daley:
The Complexity of the Validity Problem for Dynamic Logic
Information and Control 54(1/2): 48-69 (1982) |
1979 |
8 | | Leonard M. Adleman,
Kenneth L. Manders:
Reductions that Lie
FOCS 1979: 397-410 |
7 | | Kenneth L. Manders:
The Theory of all Substructures of a Structure: Characterisation and Decision Problems.
J. Symb. Log. 44(4): 583-598 (1979) |
1978 |
6 | | Kenneth L. Manders,
Leonard M. Adleman:
NP-Complete Decision Problems for Binary Quadratics.
J. Comput. Syst. Sci. 16(2): 168-184 (1978) |
1977 |
5 | | Leonard M. Adleman,
Kenneth L. Manders,
Gary L. Miller:
On Taking Roots in Finite Fields
FOCS 1977: 175-178 |
4 | | Leonard M. Adleman,
Kenneth L. Manders:
Reducibility, Randomness, and Intractability (Abstract)
STOC 1977: 151-163 |
1976 |
3 | | Leonard M. Adleman,
Kenneth L. Manders:
Diophantine Complexity
FOCS 1976: 81-88 |
2 | | Kenneth L. Manders,
Leonard M. Adleman:
NP-Complete Decision Problems for Quadratic Polynomials
STOC 1976: 23-29 |
1975 |
1 | | Leonard M. Adleman,
Kenneth L. Manders:
Computational Complexity of Decision Procedures for Polynomials (Extended Abstract)
FOCS 1975: 169-177 |