Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs

Author： Andreev A.E.   Clementi A.E.F.   Rolim J.D.P.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.221, Iss.1, 1999-06, pp. : 3-18

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A generic and distributed privacy preserving classification method with a worst-case privacy guarantee

By Banerjee Madhushri   Chen Zhiyuan   Gangopadhyay Aryya  

Distributed and Parallel Databases, Vol. 32, Iss. 1, 2014-03 ,pp. : 5-35

Springer Publishing Company

Access to resources Recommend Favorite

New methods for 3-SAT decision and worst-case analysis

By Kullmann O.  

Theoretical Computer Science, Vol. 223, Iss. 1, 1999-07 ,pp. : 1-72

Elsevier

Access to resources Recommend Favorite

Randomness vs Time: Derandomization under a Uniform Assumption

By Impagliazzo R.   Wigderson A.  

Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. : 672-688

Academic Press

Access to resources Recommend Favorite

Long-term fairness with bounded worst-case losses

By Balan Gabriel  

Autonomous Agents and Multi-Agent Systems, Vol. 22, Iss. 1, 2011-01 ,pp. : 43-63

Springer Publishing Company

Access to resources Recommend Favorite

Worst-case asymmetric distributed function computation

By Agnihotri Samar  

International Journal of General Systems, Vol. 42, Iss. 3, 2013-04 ,pp. : 268-293

Taylor & Francis Ltd

Access to resources Recommend Favorite