Skip to search formSkip to main contentSkip to account menu

Eisenstein's criterion

Known as: Criterion, Eisenstein criterion, Eisenstein polynomial 
In mathematics, Eisenstein's criterion gives a sufficient condition for a polynomial with integer coefficients to be irreducible over the rational… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Cohn's irreducibility criterionCyclotomic polynomialGauss's lemma (polynomial)Irreducible polynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Stability Analysis for Continuous-Time Positive Systems With Time-Varying Delays
This note addresses the stability problem of continuous-time positive systems with time-varying delays. It is shown that such a… 
Review
2009
Review
2009
Single-phase heat transfer in microchannels The importance of scaling effects
Highly Cited
2005
Highly Cited
2005
Interleavers for turbo codes using permutation polynomials over integer rings
A class of deterministic interleavers for turbo codes (TCs) based on permutation polynomials over /spl Zopf//sub N/ is introduced… 
Highly Cited
2005
Highly Cited
2005
Performance evaluation of an advanced local search evolutionary algorithm
One natural question when testing performance of global optimization algorithm is: how performances compare to a restart local… 
Highly Cited
2004
Highly Cited
2004
Optimal power allocation for relayed transmissions over Rayleigh-fading channels
Relayed transmission is a way to attain broader coverage by splitting the communication link from the source to the destination… 
Highly Cited
2003
Highly Cited
2003
Quantifying the early stages of plasticity through nanoscale experiments and simulations
Nucleation and kinetics of defects at the atomic scale provide the most fundamental information about the mechanical response of… 
Highly Cited
2001
Highly Cited
2001
A Simple Framework for Analyzing Bull and Bear Markets
Bull and bear markets are a common way of describing cycles in equity prices. To fully describe such cycles one would need to… 
Highly Cited
1992
Highly Cited
1992
Thresholding of digital images using two-dimensional entropies
Highly Cited
1988
Highly Cited
1988
Learning Algorithms for Connectionist Networks: Applied Gradient Methods of Nonlinear Optimization
The problem of learning using connectionist networks, in which network connection strengths are modified systematically so that… 
Highly Cited
1971
Highly Cited
1971
Recursive digital filters with maximally flat group delay
A well-known limitation of the recursive digital filter, when compared to the nonrecursive filter, is its incapability of having… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)