2168 search results - page 8 / 434 » Randomized Algorithms and Complexity Theory |
CIE
2006
Springer
15 years 3 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
60
Voted
EUROPAR
2000
Springer
15 years 3 months ago
2000
Springer
CORR
2000
Springer
14 years 11 months ago
2000
Springer
TCS
1998
14 years 11 months ago
1998
COCO
2001
Springer
15 years 4 months ago
2001
Springer