6568 search results - page 204 / 1314 » Reducing the Complexity of Reductions |
217
click to vote
MST
2011
15 years 1 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
149
click to vote
ISQED
2006
IEEE
16 years 19 days ago
2006
IEEE
Gate-length biasing is a runtime leakage reduction technique that leverages on the short-channel effect by marginally increasing the gate-length of MOS devices to significantly ...
208
click to vote
TAMC
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
215
click to vote
PODS
1994
ACM
15 years 10 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
182
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...