Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,505,745 papers from all fields of science
Search
Sign In
Create Free Account
Polynomial arithmetic
Polynomial arithmetic is a branch of algebra dealing with some properties of polynomials which share strong analogies with properties of number…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
FLINT
Mathomatic
Polynomial
Polynomial greatest common divisor
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Polynomial-time approximation for nonconvex optimization problems with an L1-constraint
Yonatan Dov Mintz
,
A. Aswani
IEEE Conference on Decision and Control
2016
Corpus ID: 12031806
Nonconvex optimization problems with an L1-constraint are ubiquitous, and are found in many application domains including…
Expand
2013
2013
Voting Power of Teams Working Together
D. Zwillinger
arXiv.org
2013
Corpus ID: 10092007
Voting power determines the "power" of individuals who cast votes; their power is based on their ability to influence the winning…
Expand
2012
2012
Destructible Password Functionality Authentication Protocol
A. A. Orunsolu
,
Moshood Abiola Polytechnic
,
A. Sodiya
2012
Corpus ID: 2930613
One of the biggest challenges that face the use of password as a security token is its low entropy. Researchers have proposed a…
Expand
2009
2009
Group Re-keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field GF(2n)
S. Sudha
,
Azman Samsudin
,
M. Alia
2009
Corpus ID: 46110877
Problem statement: In this study we propose a group re-keying protocol based on modular polynomial arithmetic over Galois Field…
Expand
2008
2008
Computing with Constructible Sets
Liyun Li
,
Yuzhen Xie
2008
Corpus ID: 116346280
2006
2006
A language for symmetric-key cryptographic algorithms and its efficient implementation
Mark Shields
2006
Corpus ID: 15589863
The development of cryptographic hardware for classified data is expensive and time consuming. We present a domain-specific…
Expand
2000
2000
On Computation of Polynomial Modular Reduction
Huapeng Wu
2000
Corpus ID: 117628249
In this paper, we consider the problem of efficient computati on of polynomial modular reduction:A(x) mod f(x), wheref(x) is a…
Expand
1992
1992
In-place Arithmetic for Polinominals over Zn
M. Monagan
Design and Implementation of Symbolic Computation…
1992
Corpus ID: 42995940
We present space and time efficient algorithms for univariate polynomial arithmetic operations over Z mod n where the modulus n…
Expand
1981
1981
Note on probabilistic algorithms in integer and polynomial arithmetic
M. Kaminski
Symposium on Symbolic and Algebraic Manipulation
1981
Corpus ID: 27260201
For many computational problems it is not known whether verification of a result can be done faster than its computation. For…
Expand
1977
1977
Polynomial Arithmetic and Contour Construction
A. Hershey
1977
Corpus ID: 118363572
Abstract : Power polynomials and trigonometric polynomials are used for the approximation of general functions. Analysis and…
Expand