2233 search results - page 13 / 447 » On the Complexity of Theory Curbing |
ISAAC
2003
Springer
14 years 8 days ago
2003
Springer
ICANN
2009
Springer
13 years 11 months ago
2009
Springer
COCO
2001
Springer
13 years 11 months ago
2001
Springer
ICRA
1999
IEEE
13 years 11 months ago
1999
IEEE
KGC
1997
Springer
13 years 11 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...