11016 search results - page 700 / 2204 » Cloud Computing for Science |
196
click to vote
WG
2004
Springer
16 years 23 days ago
2004
Springer
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
214
click to vote
WG
2004
Springer
16 years 23 days ago
2004
Springer
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H = K3
160
click to vote
WG
2004
Springer
16 years 23 days ago
2004
Springer
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
203
click to vote
FOCS
2003
IEEE
16 years 22 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
178
click to vote
FOCS
2003
IEEE
16 years 22 days ago
2003
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...