70 search results - page 14 / 14 » icalp 2007 |
158
click to vote
ICALP
2007
Springer
16 years 2 days ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
172
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
249
click to vote
IWPEC
2010
Springer
15 years 3 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
172
click to vote
ALGOSENSORS
2007
Springer
16 years 3 days ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
150
click to vote
ACISP
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. Two of the most recent and powerful multi-property-preserving (MPP) hash domain extension transforms are the Ramdom-Oracle-XOR (ROX) transform and the Enveloped Shoup (ES...