2536 search results - page 66 / 508 » Constructing Optimal Highways |
FAW
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
ECCC
2010
14 years 10 months ago
2010
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show t...
TIT
2010
14 years 4 months ago
2010
For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose error-correctio...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In this paper, we propose two new systematic ways to construct amicable orthogonal designs (AOD), with an aim to facilitate the construction of power-balanced orthogonal spacetime ...