39 search results - page 2 / 8 » On the Power of Positive Turing Reductions |
DATE
2005
IEEE
13 years 11 months ago
2005
IEEE
— This paper suggests a methodology to decrease the power of a static CMOS standard cell design at layout level by focusing on switched capacitance. The term switched is the key:...
APPROX
2007
Springer
14 years 9 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
FSTTCS
1992
Springer
13 years 10 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
GIS
2006
ACM
13 years 6 months ago
2006
ACM
Currently, most of the operations performed for the construction of marine charts are still done manually. However, with the development of more and more powerful techniques, new ...
BMCBI
2010
13 years 6 months ago
2010
Background: It is hypothesized that common, complex diseases may be due to complex interactions between genetic and environmental factors, which are difficult to detect in high-di...