8768 search results - page 6 / 1754 » Generalizing the notion of support |
MFCS
1995
Springer
15 years 3 months ago
1995
Springer
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...
100
click to vote
CRYPTO
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
CSL
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
119
click to vote
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...