Sciweavers

202 search results - page 33 / 41
» Algebra and Geometry
Sort
View
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
13 years 11 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
DAGSTUHL
2003
13 years 9 months ago
Numerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
Andrew J. Sommese, Jan Verschelde, Charles W. Wamp...
ACS
2007
13 years 7 months ago
A Topologist's View of Chu Spaces
Abstract. For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small cotopological over Xop . Its full subcateg...
Eraldo Giuli, Walter Tholen
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 7 months ago
Construction of Rational Surfaces Yielding Good Codes
In the present article, we consider algebraic geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane cu...
Alain Couvreur
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 2 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker