4066 search results - page 1 / 814 » Almost Complete Sets |
STACS
2000
Springer
15 years 4 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
101
Voted
CSR
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
132
Voted
ASIACRYPT
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
98
Voted
SIROCCO
2007
15 years 2 months ago
2007
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
107
Voted
LOGCOM
2008
15 years 1 months ago
2008
Following recent developments in the topic of generalized quantifiers, and also having in mind applications in the areas of security and artificial intelligence, a conservative en...