145 search results - page 11 / 29 » Parameterized Complexity Classes under Logical Reductions |
ACNS
2005
Springer
15 years 5 months ago
2005
Springer
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
111
click to vote
LFCS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
139
Voted
ICCV
1999
IEEE
16 years 23 days ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
74
Voted
SAS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
93
Voted
ENTCS
2010
14 years 11 months ago
2010
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...