1199 search results - page 24 / 240 » Parameterized Proof Complexity |
CORR
2011
Springer
13 years 3 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...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
PROVSEC
2007
Springer
14 years 2 months ago
2007
Springer
ASIACRYPT
2005
Springer
14 years 2 months ago
2005
Springer
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE