118 search results - page 6 / 24 » Ordinal computations |
CVPR
1996
IEEE
13 years 11 months ago
1996
IEEE
BIRTHDAY
1997
Springer
13 years 11 months ago
1997
Springer
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...