Polynomial arithmetic is a branch of algebra dealing with some properties of polynomials which share strong analogies with properties of numberâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Naman Saraf, Kia Bazargan
- 2016 International Great Lakes Symposium on VLSIâ€¦
- 2016

We present the design of stochastic computing systems based on sequential logic to implement arbitrary polynomial functionsâ€¦Â (More)

Is this relevant?

2012

2012

As for serial code on CPUs, parallel code on GPUs for dense polynomial arithmetic relies on a combination of asymptotically fastâ€¦Â (More)

Is this relevant?

2009

2009

- Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric RodrÃguez-Carbonell, Albert Rubio
- CADE
- 2009

Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particularâ€¦Â (More)

Is this relevant?

2009

2009

- Marc Moreno Maza, Yuzhen Xie
- HPCS
- 2009

We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fieldsâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Weikang Qian, Marc D. Riedel
- 2008 45th ACM/IEEE Design Automation Conference
- 2008

As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm ofâ€¦Â (More)

Is this relevant?

2008

2008

- Xin Li, Marc Moreno Maza, Raqeeb Rasheed, Ã‰ric Schost
- J. Symb. Comput.
- 2008

One of the main successes of the computer algebra community in the last 30 years has been the discovery of algorithms, calledâ€¦Â (More)

Is this relevant?

2007

2007

- Brian Rice
- 2007

The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied forâ€¦Â (More)

Is this relevant?

2003

2003

- Claire Whelan, Adam Duffy, Andrew Burnett, Tom Dowling
- PPPJ
- 2003

This paper looks at the development of a Java application programming interface (API) for performing unbounded Polynomialâ€¦Â (More)

Is this relevant?

1994

1994

- Shu Tezuka, Takeshi Tokuyama
- ACM Trans. Model. Comput. Simul.
- 1994

Authorsâ€™ address: IBM Research, Tokyo Research Laboratory, 1623-14 Shimotsuruma, Yamoto, Kanagawa 242, Japan; email: {tezukajâ€¦Â (More)

Is this relevant?

1993

1993

- Shu Tezuka
- ACM Trans. Model. Comput. Simul.
- 1993

We introduce the radical inverse function with respect to polynomial arithmetic over finite fields, and thereby construct aâ€¦Â (More)

Is this relevant?