The complexity of logical theories
- Leonard Berman
- 1980
- Theoretical Computer Science
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
132 results at Theoretical Computer Science
A semantically meaningful characterization of reducible flowchart schemes
- Calvin C. Elgot
- John C. Shepherdson
- 1979
- Theoretical Computer Science
On multiplication in algebraic extension fields
- S. Winograd
- 1979
- Theoretical Computer Science
An explicit construction of short monotone formulae for the monotone symmetric functions
- Mark Kleiman
- Nicholas Pippenger
- 1978
- Theoretical Computer Science
A uniform approach to inductive posets and inductive closure
- J.B. Wright
- E.G. Wagner
- et al.
- 1978
- Theoretical Computer Science
On the many facets of lists
- Calvin C. Elgot
- Lawrence Snyder
- 1977
- Theoretical Computer Science
Categories of chain-complete posets
- George Markowsky
- 1977
- Theoretical Computer Science
On the complexity of regular resolution and the Davis-Putnam procedure
- Zvi Galil
- 1977
- Theoretical Computer Science
Correctness of parallel programs: The Church-Rosser approach
- Barry K Rosen
- 1976
- Theoretical Computer Science
The polynomial-time hierarchy
- Larry J. Stockmeyer
- 1976
- Theoretical Computer Science