416 search results - page 1 / 84 » Correcting a Space-Efficient Simulation Algorithm |
CAV
2008
Springer
13 years 6 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
ECCC
2010
13 years 4 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
CC
2008
Springer
13 years 5 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
ANSS
1991
IEEE
13 years 8 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
ICCAD
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—It is important to reduce the Optical Proximity Correction (OPC) runtime while maintaining a good result quality. In this paper, we obtain a better formula, which theore...