Sciweavers

91 search results - page 9 / 19
» On the Polynomial Transparency of Resolution
Sort
View
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
14 years 1 months ago
Cryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
Antoine Joux, Sébastien Kunz-Jacques, Fr&ea...
JSC
2008
78views more  JSC 2008»
13 years 7 months ago
Rational Univariate Reduction via toric resultants
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
Koji Ouchi, John Keyser
JSAT
2010
158views more  JSAT 2010»
13 years 2 months ago
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...
Olga Tveretina, Carsten Sinz, Hans Zantema
IS
2006
13 years 7 months ago
The MurMur project: Modeling and querying multi-representation spatio-temporal databases
Successful information management implies the ability to design accurate representations of the real world of interest, in spite of the diversity of perceptions from the applicati...
Christine Parent, Stefano Spaccapietra, Esteban Zi...
COLT
2008
Springer
13 years 9 months ago
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...
Andrey Bernstein, Nahum Shimkin