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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This article explores the history of the Eisenstein irreducibility criterion and explains how Theodor Schönemann discovered this… (More)
  • figure 1
Is this relevant?
2010
2010
An analogue of the Eisenstein irreducibility criterion is developed for linear differential operators, or, more generally… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e… (More)
  • table 1
  • table 3
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Item recommendation is the task of predicting a personalized ranking on a set of items (e.g. websites, movies, products). In this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
1994 The copyright to this Article is held by the Econometric Society. It may be downloaded, printed and reproduced only for… (More)
Is this relevant?
2003
2003
We compute the probability for a monic univariate integer polynomial to be irreducible by Eisenstein's Criterion. In particular… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Simultaneous diagonalization of several matrices can be implemented by a Jacobi-like technique. This note gives the required… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and… (More)
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The problem of achieving COnlUnCtlve goals has been central to domain-independent planning research, the nonhnear constraint… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?