Sciweavers

425 search results - page 17 / 85
» Polynomial Factorization 1987-1991
Sort
View
IPPS
2000
IEEE
13 years 11 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 7 months ago
Partial Denominator Bounds for Partial Linear Difference Equations
We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynom...
Manuel Kauers, Carsten Schneider
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
13 years 11 months ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
CPHYSICS
2006
103views more  CPHYSICS 2006»
13 years 7 months ago
A band factorization technique for transition matrix element asymptotics
A new method of evaluating transition matrix elements between wave functions associated with orthogonal polynomials is proposed. The technique relies on purely algebraic manipulat...
Emmanuel Perrey-Debain, I. David Abrahams
ISSAC
1997
Springer
102views Mathematics» more  ISSAC 1997»
13 years 11 months ago
A Numerical Absolute Primality Test for Bivariate Polynomials
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
André Galligo, Stephen M. Watt