15033 search results - page 53 / 3007 » Complexity Theory and Algorithms |
101
Voted
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
85
Voted
ICRA
1999
IEEE
15 years 7 months ago
1999
IEEE
134
click to vote
KGC
1997
Springer
15 years 7 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...
MFCS
1992
Springer
15 years 7 months ago
1992
Springer
108
Voted
CSL
1990
Springer
15 years 7 months ago
1990
Springer
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.