549 search results - page 58 / 110 » On the Complexity of Restricted k-anonymity Problem |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
CSR
2008
Springer
14 years 11 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...