10718 search results - page 276 / 2144 » On the Circuit Implementation Problem |
137
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
248
click to vote
ECCC
2011
15 years 1 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
160
click to vote
CASC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We describe a symbolic framework for treating linear boundary problems with a generic implementation in the Theorema system. For ordinary differential equations, the ope...
170
Voted
TON
2010
15 years 5 months ago
2010
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
143
click to vote
MFCS
2004
Springer
15 years 12 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...