1199 search results - page 24 / 240 » Parameterized Proof Complexity |
138
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
98
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
ASIACRYPT
2005
Springer
15 years 9 months ago
2005
Springer
87
Voted
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE