Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,472,153 papers from all fields of science
Search
Sign In
Create Free Account
Polynomial remainder theorem
Known as:
Bezout's little theorem
, Remainder theorem
, Little Bezout Theorem (Factor Theorem)
Expand
In algebra, the polynomial remainder theorem or little Bézout's theorem is an application of Euclidean division of polynomials. It states that the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Bruun's FFT algorithm
Factor theorem
Horner's method
Polynomial
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Chinese Remainder Theorem-Based Secret Image Sharing for (k, n) Threshold
Xuehu Yan
,
Yuliang Lu
,
Lintao Liu
,
Song Wan
,
Wanmeng Ding
,
Hanlin Liu
International Conference on Communication…
2017
Corpus ID: 26487697
In comparison with Shamir’s original polynomial-based secret image sharing (SIS), Chinese remainder theorem-based SIS (CRTSIS…
Expand
Highly Cited
2011
Highly Cited
2011
Fast Polynomial Factorization and Modular Composition
K. Kedlaya
,
C. Umans
SIAM journal on computing (Print)
2011
Corpus ID: 412751
We obtain randomized algorithms for factoring degree $n$ univariate polynomials over $F_q$ requiring $O(n^{1.5 + o(1)} log^{1+o…
Expand
Highly Cited
2011
Highly Cited
2011
Sparse Sensing With Co-Prime Samplers and Arrays
P. Vaidyanathan
,
Piya Pal
IEEE Transactions on Signal Processing
2011
Corpus ID: 8420104
This paper considers the sampling of temporal or spatial wide sense stationary (WSS) signals using a co-prime pair of sparse…
Expand
Highly Cited
2010
Highly Cited
2010
A Closed-Form Robust Chinese Remainder Theorem and Its Performance Analysis
Wenjie Wang
,
X. Xia
IEEE Transactions on Signal Processing
2010
Corpus ID: 10696673
Chinese remainder theorem (CRT) reconstructs an integer from its multiple remainders that is well-known not robust in the sense…
Expand
Highly Cited
2009
Highly Cited
2009
Computing Hilbert class polynomials with the Chinese remainder theorem
Andrew V. Sutherland
Mathematics of Computation
2009
Corpus ID: 5366828
We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an…
Expand
Highly Cited
2008
Highly Cited
2008
Algebraic Signal Processing Theory: Foundation and 1-D Time
Markus Püschel
,
José M. F. Moura
IEEE Transactions on Signal Processing
2008
Corpus ID: 206797175
This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal…
Expand
Highly Cited
2007
Highly Cited
2007
Chinese remainder theorem based group key management
Xinliang Zheng
,
Chin-Tser Huang
,
M. Matthews
ACM-SE 45
2007
Corpus ID: 5515890
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By…
Expand
Highly Cited
2001
Highly Cited
2001
On the algebraic structure of quasi-cyclic codes I: Finite fields
S. Ling
,
P. Solé
IEEE Transactions on Information Theory
2001
Corpus ID: 16754424
A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as a…
Expand
Highly Cited
1995
Highly Cited
1995
Fast Combinatorial RNS Processors for DSP Applications
E. D. D. Claudio
,
F. Piazza
,
G. Orlandi
IEEE Trans. Computers
1995
Corpus ID: 41462872
It is known that RNS VLSI processors can parallelize fixed-point addition and multiplication operations by the use of the Chinese…
Expand
Highly Cited
1991
Highly Cited
1991
Remote password authentication with smart cards
Chinchen Chang
,
Tzong-Chen Wu
1991
Corpus ID: 62730297
A remote password authentication scheme based on the Chinese remainder theorem is proposed. The scheme can verify the remote…
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