Sciweavers

ANTS
2006
Springer
118views Algorithms» more  ANTS 2006»
14 years 26 days ago
Construction of Rational Points on Elliptic Curves over Finite Fields
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
Andrew Shallue, Christiaan van de Woestijne
38
Voted
COCO
1999
Springer
79views Algorithms» more  COCO 1999»
14 years 3 months ago
Non-Automatizability of Bounded-Depth Frege Proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
Maria Luisa Bonet, Carlos Domingo, Ricard Gavald&a...