Search results for "Sparse polynomials"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Andrew Paul Smith	Fast construction of constant bound functions for sparse polynomials.	J. Global Optimization	2009	DBLP DOI BibTeX RDF	Constrained global optimization, Interval arithmetic, Relaxation, Lazy evaluation, Multivariate polynomials, Bernstein polynomials, Bound functions
2	Álvar Ibeas, Arne Winterhof	Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields.	AAECC	2009	DBLP DOI BibTeX RDF	Noisy interpolation, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem
2	Igor Shparlinski, Arne Winterhof	Noisy interpolation of sparse polynomials in finite fields.	Appl. Algebra Eng. Commun. Comput.	2005	DBLP DOI BibTeX RDF	Noisy interpolation, Finite fields, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem
2	Michael Schmitt	An Improved VC Dimension Bound for Sparse Polynomials.	COLT	2004	DBLP DOI BibTeX RDF
2	William D. Banks, Daniel Lieman, Igor Shparlinski, Van Thuong To	Cryptographic Applications of Sparse Polynomials over Finite Rings.	ICISC	2000	DBLP DOI BibTeX RDF
2	Marek Karpinski, Igor Shparlinski	On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials.	AAECC	1999	DBLP DOI BibTeX RDF
2	Yishay Mansour	Randomized Interpolation and Approximation of Sparse Polynomials.	ICALP	1992	DBLP DOI BibTeX RDF
1	Martin Weimann	Algebraic Osculation and Application to Factorization of Sparse Polynomials.	Foundations of Computational Mathematics	2012	DBLP DOI BibTeX RDF
1	Martin Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek	Faster p-adic feasibility for certain multivariate sparse polynomials.	J. Symb. Comput.	2012	DBLP DOI BibTeX RDF
1	Shubhangi Saraf, Sergey Yekhanin	Noisy Interpolation of Sparse Polynomials, and Applications.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Shubhangi Saraf, Sergey Yekhanin	Noisy Interpolation of Sparse Polynomials, and Applications.	IEEE Conference on Computational Complexity	2011	DBLP DOI BibTeX RDF
1	Elena Grigorescu, Kyomin Jung, Ronitt Rubinfeld	A local decision test for sparse polynomials.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Martin Weimann	A lifting and recombination algorithm for rational factorization of sparse polynomials.	J. Complexity	2010	DBLP DOI BibTeX RDF
1	Lin Xu, Dongdai Lin, Xin Li	A New Efficient Algorithm for Computing All Low Degree Annihilators of Sparse Polynomials with a High Number of Variables.	ISPEC	2010	DBLP DOI BibTeX RDF
1	Mickaël Gastineau	Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket.	PASCO	2010	DBLP DOI BibTeX RDF
1	Holger Rauhut, Rachel Ward	Efficient and stable recovery of Legendre-sparse polynomials.	CISS	2010	DBLP DOI BibTeX RDF
1	Martin Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek	Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable.	ISSAC	2010	DBLP DOI BibTeX RDF
1	Amir Shpilka, Ilya Volkovich	Read-once polynomial identity testing.	STOC	2008	DBLP DOI BibTeX RDF	bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits
1	Chiou-Yng Lee, Pramod Kumar Meher	Efficient Bit-Parallel Multipliers in Composite Fields.	APSCC	2008	DBLP DOI BibTeX RDF
1	Qi Cheng, Yu-Hsin Li	A Number Theoretic Memory Bounded Function and Its Applications.	ICYCS	2008	DBLP DOI BibTeX RDF
1	Enes Pasalic	On Cryptographically Significant Mappings over GF(2n).	WAIFI	2008	DBLP DOI BibTeX RDF
1	Fatima K. Abu Salem, Laurence Tianruo Yang	Parallel methods for absolute irreducibility testing.	The Journal of Supercomputing	2008	DBLP DOI BibTeX RDF	Bivariate polynomials, Absolute irreducibility, Newton polytopes, Bulk synchronous model, Parallel algorithms, Multivariate polynomials
1	Erich Kaltofen, Zhengfeng Yang, Lihong Zhi	On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms.	SNC	2007	DBLP DOI BibTeX RDF	multivariate rational function, random matrix, structured matrix, interpolation, probabilistic analysis, condition number, sparse polynomial, symbolic/numeric hybrid method
1	Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan	Testing for Concise Representations.	FOCS	2007	DBLP DOI BibTeX RDF
1	Michael B. Monagan, Roman Pearce	Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors.	CASC	2007	DBLP DOI BibTeX RDF
1	Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong	Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields.	Des. Codes Cryptography	2006	DBLP DOI BibTeX RDF	AMS Classification Primary 12Y05, Secondary 11T71
1	Erich Kaltofen, Pascal Koiran	Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields.	ISSAC	2006	DBLP DOI BibTeX RDF	Lang conjecture, lacunary polynomials, multivariate polynomials, polynomial-time complexity, polynomial factorization, sparse polynomials, height, algebraic numbers
1	Le Van Ly	Polly Two : A New Algebraic Polynomial-based Public-Key Scheme.	Appl. Algebra Eng. Commun. Comput.	2006	DBLP DOI BibTeX RDF	Combinatorially algebraic public-key cryptoschemes, Polly Cracker, EnRoot, Linear-Algebra attacks, System of algebraic equations, Elimination ideals, Sparse polynomials
1	J. Maurice Rojas, Yinyu Ye	On solving univariate sparse polynomials in logarithmic time.	J. Complexity	2005	DBLP DOI BibTeX RDF
1	Daniel Perrucci	Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	Erich Kaltofen, Pascal Koiran	On the complexity of factoring bivariate supersparse (Lacunary) polynomials.	ISSAC	2005	DBLP DOI BibTeX RDF	lacunary polynomials, NP-hardness, multivariate polynomials, polynomial-time complexity, polynomial factorizations, sparse polynomials
1	Kosaku Nagasaka	Towards More Accurate Separation Bounds of Empirical Polynomials II.	CASC	2005	DBLP DOI BibTeX RDF
1	Masakazu Kojima, Sunyoung Kim, Hayato Waki	Sparsity in sums of squares of polynomials.	Math. Program.	2005	DBLP DOI BibTeX RDF	Sums of squares of polynomial, Polynomial optimization problem, Semidefinite program, Sparsity
1	Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták	Efficient Algorithms for Finding Submasses in Weighted Strings.	CPM	2004	DBLP DOI BibTeX RDF
1	Sarbani Palit, Bimal K. Roy, Arindom De	A Fast Correlation Attack for LFSR-Based Stream Ciphers.	ACNS	2003	DBLP DOI BibTeX RDF	LFSR polynomial, Correlation immune function, Stream cipher, Correlation attack
1	Igor Shparlinski	Sparse polynomial approximation in finite fields.	STOC	2001	DBLP DOI BibTeX RDF	finite fields, exponential sums, sparse polynomials
1	Adam Klivans, Daniel A. Spielman	Randomness efficient identity testing of multivariate polynomials.	STOC	2001	DBLP DOI BibTeX RDF
1	Feng Bao, Robert H. Deng, Willi Geiselmann, Claus-Peter Schnorr, Rainer Steinwandt, Hongjun Wu	Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems.	Public Key Cryptography	2001	DBLP DOI BibTeX RDF
1	William D. Banks, Daniel Lieman, Igor Shparlinski	An Identification Scheme Based on Sparse Polynomials.	Public Key Cryptography	2000	DBLP DOI BibTeX RDF
1	Marek Karpinski, Igor Shparlinski	On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials	Electronic Colloquium on Computational Complexity (ECCC)	1999	DBLP BibTeX RDF
1	Dima Grigoriev, Alexander A. Razborov	Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields.	FOCS	1998	DBLP DOI BibTeX RDF	depth 3 arithmetic circuits, exponential lower bounds, approximating by sparse polynomials
1	Marek Karpinski, Igor Shparlinski	On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields.	Theor. Comput. Sci.	1996	DBLP DOI BibTeX RDF
1	Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko	Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann.	Fundam. Inform.	1996	DBLP DOI BibTeX RDF
1	Yagati N. Lakshman, B. David Saunders	Sparse shifts for univariate polynomials.	Appl. Algebra Eng. Commun. Comput.	1996	DBLP DOI BibTeX RDF	BCH decoding, Pochhammer basis, Chebyshev basis, Descartes’ rule of signs, Sparse polynomials, Real roots
1	Noga Alon, Yishay Mansour	epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials.	Inf. Process. Lett.	1995	DBLP DOI BibTeX RDF
1	Yishay Mansour	Randomized Interpolation and Approximation of Sparse Polynomials.	SIAM J. Comput.	1995	DBLP DOI BibTeX RDF
1	Marek Karpinski, Thorsten Werther	VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions.	SIAM J. Comput.	1993	DBLP DOI BibTeX RDF
1	Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko	Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.	ISSAC	1992	DBLP DOI BibTeX RDF
1	Chandrajit L. Bajaj, John F. Canny, R. Garrity, Joe D. Warren	Factoring Rational Polynomials over the Complexes.	ISSAC	1989	DBLP DOI BibTeX RDF
1	David K. Probst, Vangalur S. Alagar	Corrigendum: A Family of Algorithms for Powering Sparse Polynomials.	SIAM J. Comput.	1980	DBLP DOI BibTeX RDF
1	David K. Probst, Vangalur S. Alagar	A Family of Algorithms for Powering Sparse Polynomials.	SIAM J. Comput.	1979	DBLP DOI BibTeX RDF
1	Richard Zippel	Probabilistic algorithms for sparse polynomials.	EUROSAM	1979	DBLP DOI BibTeX RDF
1	Vangalur S. Alagar, David K. Probst	Binomial-Expansion Algorithms for Copmuting Integer Powers of Sparse Polynomials.	International Computing Symposium	1977	DBLP BibTeX RDF