Results 231 to 240 of about 4,649,595 (248)
Some of the next articles are maybe not open access.
Journal of the ACM, 1994
We carry out an analysis of typability of terms in ML. Our main result is that this problem is DEXPTIME-hard, where by DEXPTIME we mean DTIME(2 n 0(1) ). This, together with the known exponential-time algorithm that solves the problem, yields the DEXPTIME-completeness result. This settles an open problem
A. J. Kfoury +2 more
openaire +2 more sources
We carry out an analysis of typability of terms in ML. Our main result is that this problem is DEXPTIME-hard, where by DEXPTIME we mean DTIME(2 n 0(1) ). This, together with the known exponential-time algorithm that solves the problem, yields the DEXPTIME-completeness result. This settles an open problem
A. J. Kfoury +2 more
openaire +2 more sources

