2661 search results - page 163 / 533 » Quantum Complexity Classes |
120
click to vote
ICALP
1995
Springer
15 years 7 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
111
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
138
Voted
NETWORKS
2011
14 years 10 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
137
click to vote
TIFS
2010
14 years 10 months ago
2010
Quantitative steganalysis strives to estimate the change rate defined as the relative number of embedding changes introduced by steganography. In this paper, we propose two new cla...
141
Voted
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...