Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,097,339 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
2004
Highly Cited
2004
Cyclic redundancy code (CRC) polynomial selection for embedded networks
P. Koopman
,
T. Chakravarty
International Conference on Dependable Systems…
2004
Corpus ID: 793862
Cyclic redundancy codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many…
Expand
Highly Cited
2003
Highly Cited
2003
Carbon Nanotube Sensors for Gas and Organic Vapor Detection
Jing Li
,
Yijiang Lu
,
Q. Ye
,
Martin Cinke
,
Jie Han
,
M. Meyyappan
2003
Corpus ID: 42587461
A gas sensor, fabricated by the simple casting of single-walled carbon nanotubes (SWNTs) on an interdigitated electrode (IDE), is…
Expand
Highly Cited
2001
Highly Cited
2001
A polynomial algorithm for testing diagnosability of discrete-event systems
Shengbing Jiang
,
Zhongdong Huang
,
V. Chandra
,
Ratnesh Kumar
IEEE Transactions on Automatic Control
2001
Corpus ID: 1568142
Failure diagnosis in large and complex systems is a critical task. In the realm of discrete-event systems, Sampath et al. (1995…
Expand
Highly Cited
1997
Highly Cited
1997
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
E. Fujisaki
,
T. Okamoto
Annual International Cryptology Conference
1997
Corpus ID: 23275799
This paper proposes a bit commitment scheme, BC(·), and efficient statistical zero knowledge (in short, SZK) protocols in which…
Expand
Highly Cited
1997
Highly Cited
1997
An exact quantum polynomial-time algorithm for Simon's problem
G. Brassard
,
P. Høyer
Proceedings of the Fifth Israeli Symposium on…
1997
Corpus ID: 5177739
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a…
Expand
Highly Cited
1996
Highly Cited
1996
Robust Characterizations of Polynomials with Applications to Program Testing
R. Rubinfeld
,
M. Sudan
SIAM journal on computing (Print)
1996
Corpus ID: 16788823
The study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here the…
Expand
Highly Cited
1995
Highly Cited
1995
Bayesian Learning for Neural Networks
Radford M. Neal
1995
Corpus ID: 60809283
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions…
Expand
Highly Cited
1990
Highly Cited
1990
Chebyshev polynomials : from approximation theory to algebra and number theory
T. J. Rivlin
1990
Corpus ID: 121583991
Definitions and Some Elementary Properties Extremal Properties Expansion of Functions in Series of Chebyshev Polynomials…
Expand
Highly Cited
1988
Highly Cited
1988
Link scheduling in polynomial time
B. Hajek
,
G. Sasaki
IEEE Transactions on Information Theory
1988
Corpus ID: 5006781
Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network. The constraint on…
Expand
Highly Cited
1983
Highly Cited
1983
Polynomials and linear control systems
S. Barnett
1983
Corpus ID: 122836424
Read more and get great! That's what the book enPDFd polynomials and linear control systems will give for every reader to read…
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