31324 search results - page 198 / 6265 » Compare |
204
Voted
OGAI
1993
15 years 9 months ago
1993
265
click to vote
LCC
1994
15 years 9 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
146
click to vote
LFCS
1994
Springer
15 years 9 months ago
1994
Springer
We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt's typed -cube [4]. The first is obtained from the latter through applying...