757 search results - page 7 / 152 » On the hardness of approximating Max-Satisfy |
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
ASIACRYPT
1999
Springer
15 years 1 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
113
Voted
STOC
2012
ACM
13 years 1 days ago
2012
ACM
TON
2012
13 years 1 days ago
2012
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...