915 search results - page 35 / 183 » Proof labeling schemes |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...
PROCEDIA
2010
13 years 6 months ago
2010
In this short note, a direct proof of L2 convergence of an Euler–Maruyama approximation of a Zakai equation driven by a square integrable martingale is shown. The order of conve...
MST
2010
13 years 6 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
IJISMD
2010
13 years 5 months ago
2010
The value of business process models is dependent not only on the choice of graphical elements in the model, but also on their annotation with additional textual and graphical inf...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...