Skip to main content
Conference ProceedingsOPEN ACCESS

On polynomial time computable problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1981) 108 LNCS 152-158
DOI: 10.1007/3-540-10704-5_13
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we investigate problems which require O(nk) time, for each interger k, where n is the size of input. Also, we present a number of problems which require exponential time.

Cite

CITATION STYLE

APA

Kasai, T., & Adachi, A. (1981). On polynomial time computable problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 108 LNCS, pp. 152–158). Springer Verlag. https://doi.org/10.1007/3-540-10704-5_13

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