Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,345 papers from all fields of science
Search
Sign In
Create Free Account
Polynomial
Known as:
Polynomial curve
, Standard form of a polynomial
, Complex Polynomial
Expand
In mathematics, a polynomial is an expression consisting of variables and coefficients which only employs the operations of addition, subtraction…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Bernstein's theorem (polynomials)
Bracket polynomial
Bézier curve
Bézout matrix
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
Optimal oblivious routing in polynomial time
Y. Azar
,
Edith Cohen
,
A. Fiat
,
Haim Kaplan
,
Harald Räcke
Symposium on the Theory of Computing
2003
Corpus ID: 33364366
A recent seminal result of Racke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio…
Expand
Highly Cited
2002
Highly Cited
2002
The Wiener-Askey Polynomial Chaos for Stochastic Differential Equations
Dongbin Xiu
,
G. Karniadakis
SIAM Journal on Scientific Computing
2002
Corpus ID: 264216115
We present a new method for solving stochastic differential equations based on Galerkin projections and extensions of Wiener's…
Expand
Highly Cited
2001
Highly Cited
2001
Polynomial texture maps
T. Malzbender
,
Dan Gelb
,
H. Wolters
International Conference on Computer Graphics and…
2001
Corpus ID: 7584429
In this paper we present a new form of texture mapping that produces increased photorealism. Coefficients of a biquadratic…
Expand
Highly Cited
1999
Highly Cited
1999
Oblivious transfer and polynomial evaluation
M. Naor
,
Benny Pinkas
Symposium on the Theory of Computing
1999
Corpus ID: 13192237
We describe efficient constructions for two oblivious twoparty computation problems: l-out-of-N Oblivious Transfer &d ‘Oblivious…
Expand
Highly Cited
1994
Highly Cited
1994
Interior-point polynomial algorithms in convex programming
Y. Nesterov
,
A. Nemirovski
Siam studies in applied mathematics
1994
Corpus ID: 117194167
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path…
Expand
Highly Cited
1985
Highly Cited
1985
A new polynomial invariant of knots and links
P. Freyd
,
D. Yetter
,
J. Hoste
,
W. Lickorish
,
K. Millett
,
A. Ocneanu
1985
Corpus ID: 17098217
The purpose of this note is to announce a new isotopy invariant of oriented links of tamely embedded circles in 3-space. We…
Expand
Highly Cited
1984
Highly Cited
1984
A new polynomial-time algorithm for linear programming
N. Karmarkar
Symposium on the Theory of Computing
1984
Corpus ID: 7257867
We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic…
Expand
Highly Cited
1982
Highly Cited
1982
The NP-Completeness Column: An Ongoing Guide
David S. Johnson
J. Algorithms
1982
Corpus ID: 2211006
Highly Cited
1980
Highly Cited
1980
Fast Probabilistic Algorithms for Verification of Polynomial Identities
J. Schwartz
Journal of the ACM
1980
Corpus ID: 8314102
The s tar thng success o f the Rabm-S t ra s sen -So lovay p n m a h t y algori thm, together wi th the intr iguing foundat tonal…
Expand
Highly Cited
1971
Highly Cited
1971
Polynomial Theory of Complex Systems
A. G. Ivakhnenko
,
Yu V Koppa
,
I. K. Tymchenko
,
N. O. Ivakhnenko
,
A. Mucciardi
IEEE Transactions on Systems, Man and Cybernetics
1971
Corpus ID: 17606980
A complex multidimensional decision hypersurface can be approximated by a set of polynomials in the input signals (properties…
Expand
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