Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,346 papers from all fields of science
Search
Sign In
Create Free Account
Degree of a polynomial
Known as:
Nonic equation
, Polynomial degree
, Hectic equation
Expand
The degree of a polynomial is the highest degree of its terms when the polynomial is expressed in its canonical form consisting of a linear…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Alternating polynomial
Analysis of algorithms
Approximation theory
B-spline
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
How will climate change modify river flow regimes in Europe
C. Schneider
,
C. Laizé
,
M. Acreman
,
M. Flörke
2012
Corpus ID: 53456395
Worldwide, flow regimes are being modified by various anthropogenic impacts and climate change induces an additional risk. Rising…
Expand
Highly Cited
2009
Highly Cited
2009
Advanced modularity-specialized label propagation algorithm for detecting communities in networks
Xin Liu
,
T. Murata
2009
Corpus ID: 118522282
Highly Cited
2007
Highly Cited
2007
Finite difference/spectral approximations for the time-fractional diffusion equation
Yumin Lin
,
Chuanju Xu
Journal of Computational Physics
2007
Corpus ID: 40378825
Highly Cited
2006
Highly Cited
2006
Karhunen-Loève approximation of random fields by generalized fast multipole methods
C. Schwab
,
R. Todor
Journal of Computational Physics
2006
Corpus ID: 18577778
Highly Cited
2005
Highly Cited
2005
Evaluating 2-DNF Formulas on Ciphertexts
D. Boneh
,
Eu-Jin Goh
,
Kobbi Nissim
Theory of Cryptography Conference
2005
Corpus ID: 785423
Let ψ be a 2-DNF formula on boolean variables x1,...,xn ∈ {0,1}. We present a homomorphic public key encryption scheme that…
Expand
Highly Cited
2003
Highly Cited
2003
Polynomial degree vs. quantum query complexity
A. Ambainis
44th Annual IEEE Symposium on Foundations of…
2003
Corpus ID: 1228502
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f…
Expand
Highly Cited
2001
Highly Cited
2001
Randomness efficient identity testing of multivariate polynomials
Adam R. Klivans
,
D. Spielman
Symposium on the Theory of Computing
2001
Corpus ID: 14881605
We present a randomized polynomial time algorithm to determine if a multivariate polynomial is zero using <italic>O(\log mn…
Expand
Highly Cited
1992
Highly Cited
1992
On the degree of boolean functions as real polynomials
N. Nisan
,
M. Szegedy
Symposium on the Theory of Computing
1992
Corpus ID: 6919144
Every Boolean function may be represented as a real polynomial. In this paper, we characterize the degree of this polynomial in…
Expand
Highly Cited
1980
Highly Cited
1980
A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem
H. Psaraftis
1980
Corpus ID: 62689860
An investigation of the single-vehicle, many-to-many, immediate-request dial-a-ride problem is developed in two parts I and II…
Expand
Highly Cited
1976
Highly Cited
1976
On "Bent" Functions
O. Rothaus
Journal of combinatorial theory. Series A
1976
Corpus ID: 28281588
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)
ACCEPT & CONTINUE