Sciweavers

COCO
2010
Springer
133views Algorithms» more  COCO 2010»
14 years 1 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
14 years 1 months ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
COCO
2010
Springer
215views Algorithms» more  COCO 2010»
14 years 1 months ago
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
Eric Allender, Klaus-Jörn Lange
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
14 years 1 months ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir
ALDT
2009
Springer
149views Algorithms» more  ALDT 2009»
14 years 1 months ago
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
Bart de Keijzer, Sylvain Bouveret, Tomas Klos, Yin...
COCO
2010
Springer
136views Algorithms» more  COCO 2010»
14 years 1 months ago
Relationless Completeness and Separations
Pavel Hrubes, Avi Wigderson, Amir Yehudayoff
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
14 years 1 months ago
On Weil Polynomials of K3 Surfaces
Abstract. For K3 surfaces, we derive some conditions the characteristic polynomial of the Frobenius on the ´etale cohomology must satisfy. These conditions may be used to speed up...
Andreas-Stephan Elsenhans, Jörg Jahnel
ANTS
2010
Springer
268views Algorithms» more  ANTS 2010»
14 years 1 months ago
Lattices and Spherical Designs
Gabriele Nebe
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
14 years 1 months ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
14 years 1 months ago
Visualizing Elements of Sha[3] in Genus 2 Jacobians
Abstract. Mazur proved that any element ξ of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in...
Nils Bruin, Sander R. Dahmen