256 search results - page 44 / 52 » Separation of NP-Completeness Notions |
PEPM
2009
ACM
14 years 4 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
CHI
2010
ACM
14 years 2 months ago
2010
ACM
Programming has recently become more common among ordinary end users of computer systems. We believe that these end-user programmers are not just coders but also designers, in tha...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...