Polynomial complexity - Open Access .click

Results 261 to 270 of about 381,752 (282)

Some of the next articles are maybe not open access.

Sci. Ann. Cuza Univ., 2022
We introduce a new notion in the frame of near-rings called complex polynomial rings. We study these rings and obtain some properties about them.
openaire +1 more source

On the complexity of genuinely polynomial computation

2005
We present separation results on genuinely (or strongly) time bounded sequential, parallel and nondeterministic complexity classes defined by RAMs with fixed set of arithmetic operations. In particular, we separate non-uniform polynomial time from non-uniform parallel polynomial time for the set of operations {+, −, *} (answering a question of [M 88]),
Marek Karpinski, Friedhelm Meyer auf der Heide +1 more
openaire +1 more source

Complex Polynomials

2022
openaire +1 more source

Polynomial degree vs. quantum query complexity

Journal of Computer and System Sciences, 2006
Andris Ambainis
exaly

Low-Complexity Polynomial Channel Estimation in Large-Scale MIMO With Arbitrary Statistics

IEEE Journal on Selected Topics in Signal Processing, 2014
Emil Bjornson, Mats Bengtsson, Merouane Debbah +2 more
exaly

The Complexity of Computing the Sign of the Tutte Polynomial

SIAM Journal on Computing, 2014
Leslie Ann Goldberg, Mark Jerrum
exaly

Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time

Journal of Soviet Mathematics, 1986
A L Chistov
exaly

A note on the complexity of a phaseless polynomial interpolation

Journal of Complexity, 2020
Paweł Siedlecki
exaly