# Kenneth L. Manders

According to our database

Collaborative distances:

^{1}, Kenneth L. Manders authored at least 13 papers between 1975 and 1987.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1987

On Algebraic Geometry Over Rings with Exponentiation.

Math. Log. Q., 1987

1985

Logic and conceptual relationships in mathematics.

Proceedings of the Logic Colloquium '85, Orsay, France, 1985

1982

The Complexity of the Validity Problem for Dynamic Logic

Information and Control, 1982

1980

Theories With the Existential Substructure Property.

Math. Log. Q., 1980

1979

The Theory of all Substructures of a Structure: Characterisation and Decision Problems.

J. Symb. Log., 1979

Reductions that Lie

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

NP-Complete Decision Problems for Binary Quadratics.

J. Comput. Syst. Sci., 1978

1977

The impact of complexity theory on algorithms for sparse polynomials.

ACM SIGSAM Bulletin, 1977

Reducibility, Randomness, and Intractability (Abstract)

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

On Taking Roots in Finite Fields

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

NP-Complete Decision Problems for Quadratic Polynomials

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

Diophantine Complexity

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

Computational Complexity of Decision Procedures for Polynomials (Extended Abstract)

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975