Sciweavers

137 search results - page 2 / 28
» Deformation Techniques for Efficient Polynomial Equation Sol...
Sort
View
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 5 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
TSMC
2008
147views more  TSMC 2008»
13 years 5 months ago
A New Approach for Solving Nonlinear Equations Systems
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...
Crina Grosan, Ajith Abraham
MOC
2011
13 years 22 days ago
Regeneration homotopies for solving systems of polynomials
We present a new technique, based on polynomial continuation, for solving systems of n polynomials in N complex variables. The method allows equations to be introduced one-by-one o...
Jonathan D. Hauenstein, Andrew J. Sommese, Charles...
CAV
2008
Springer
170views Hardware» more  CAV 2008»
13 years 7 months ago
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...
Himanshu Jain, Edmund M. Clarke, Orna Grumberg
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
12 years 9 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid