Skip to main content
Conference Proceedings

Bounded set theory and polynomial computability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1987) 278 LNCS 391-395
DOI: 10.1007/3-540-18740-5_84
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Sazonov, V. Y. (1987). Bounded set theory and polynomial computability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 278 LNCS, pp. 391–395). Springer Verlag. https://doi.org/10.1007/3-540-18740-5_84

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free