Sciweavers

94
Voted
ICS
2010
Tsinghua U.
16 years 21 days ago
Effectively Polynomial Simulations
Toniann Pitassi, Rahul Santhanam
134
Voted
ICS
2010
Tsinghua U.
16 years 21 days ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
ICS
2010
Tsinghua U.
16 years 21 days ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
99
Voted
ICS
2010
Tsinghua U.
16 years 21 days ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
111
Voted
ICS
2010
Tsinghua U.
16 years 21 days ago
A New Approximation Technique for Resource-Allocation Problems
Barna Saha, Aravind Srinivasan
ICS
2010
Tsinghua U.
16 years 21 days ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
ICS
2010
Tsinghua U.
16 years 21 days ago
Cryptographic Complexity Classes and Computational Intractability Assumptions
Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek