Sciweavers

198 search results - page 13 / 40
» The Multiplicative Quantum Adversary
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
AINA
2006
IEEE
14 years 1 months ago
Efficacy of Coordinated Distributed Multiple Attacks (A Proactive Approach to Cyber Defense)
In the network-centric approach to information operations, users share information robustly by means of a secure infrastructure that enables self-synchronization and, ultimately, ...
Patrick Defibaugh-Chavez, Srinivas Mukkamala, Andr...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 7 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
TCC
2009
Springer
160views Cryptology» more  TCC 2009»
14 years 8 months ago
Simple, Black-Box Constructions of Adaptively Secure Protocols
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
TCOM
2011
94views more  TCOM 2011»
13 years 2 months ago
Protection Against Link Errors and Failures Using Network Coding
—We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The end nodes of the bidirec...
Shizheng Li, Aditya Ramamoorthy