54 search results - page 8 / 11 » cie 2007 |
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
53
Voted
CIE
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. As one simple type of statistical inference problems we consider Most Likely Solution problem, a task of finding a most likely solution (MLS in short) for a given proble...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
We expose a strict hierarchy within monotone monadic strict NP without inequalities (MMSNP), based on the number of second-order monadic quantifiers. We do this by studying a fin...
69
Voted
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...