1477 search results - page 70 / 296 » Complexity of (iterated) dominance |
254
click to vote
IWPEC
2010
Springer
15 years 4 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...
177
click to vote
LACL
2005
Springer
15 years 11 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
169
click to vote
DOCENG
2004
ACM
15 years 11 months ago
2004
ACM
This paper reviews the main innovations of XML and considers their impact on the editing techniques for structured documents. Namespaces open the way to compound documents; well-f...
159
click to vote
IPL
2006
15 years 6 months ago
2006
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
172
click to vote
EUROCRYPT
2000
Springer
15 years 9 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...