3415 search results - page 199 / 683 » Lower bounds on kernelization |
192
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
141
click to vote
ARITH
1999
IEEE
15 years 10 months ago
1999
IEEE
Quotients, reciprocals, square roots and square root reciprocals all have the property that infinitely precise
163
click to vote
SIROCCO
2007
15 years 7 months ago
2007
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
157
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
161
Voted
SSWMC
2004
15 years 7 months ago
2004
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...