1998 search results - page 196 / 400 » Complexity of the Cover Polynomial |
173
click to vote
TIFS
2010
15 years 1 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...
159
click to vote
WG
2005
Springer
16 years 1 days ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
205
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
225
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
175
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...