Results 231 to 240 of about 4,649,595 (248)
Some of the next articles are maybe not open access.

An analysis of ML typability

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

OpinionMining-ML

Computer Standards & Interfaces, 2013
Livio Robaldo, Luigi Di Caro
openaire   +1 more source

Mls and Tolerance

Immunological Reviews, 1989
H, Festenstein, S, Kumura, G, Biasi
openaire   +2 more sources

On the Insider Security of MLS

2022
Joël Alwen   +2 more
openaire   +2 more sources

HOL-ML

1994
Myra Van Inwegen, Elsa L. Gunter
openaire   +1 more source

ML

1984
Alan Bundy, Lincoln Wallen
openaire   +1 more source

ML

2011
David Padua   +40 more
openaire   +1 more source

The Mls Reaction

Annals of the New York Academy of Sciences, 1988
U, Hammerling   +3 more
openaire   +2 more sources

ml

1974
openaire   +1 more source

Home - About - Disclaimer - Privacy