Results 241 to 250 of about 36,366 (263)
Some of the next articles are maybe not open access.
On the complexity of genuinely polynomial computation
2005We 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 +1 more
openaire +1 more source
On polynomial ideals, their complexity, and applications
1995A polynomial ideal membership problem is a (w+1)-tuple P=(f, g1,g2, ..., g w ) where f and the g i are multivariate polynomials over some ring, and the problem is to determine whether f is in the ideal generated by the g i . For polynomials over the integers or rationals, it is known that this problem is exponential space complete.
openaire +1 more source
Sci. Ann. Cuza Univ., 1995
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
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
Polynomial degree vs. quantum query complexity
Journal of Computer and System Sciences, 2006Andris Ambainis
exaly
A note on the complexity of a phaseless polynomial interpolation
Journal of Complexity, 2020Paweł Siedlecki
exaly
The Complexity of Computing the Sign of the Tutte Polynomial
SIAM Journal on Computing, 2014Mark Jerrum, Leslie Goldberg
exaly
On the subword complexity of Thue–Morse polynomial extractions
Theoretical Computer Science, 2007Yossi Moshe
exaly
Low-Complexity Polynomial Channel Estimation in Large-Scale MIMO With Arbitrary Statistics
IEEE Journal on Selected Topics in Signal Processing, 2014Merouane Debbah +2 more
exaly
Intrinsic complexity estimates in polynomial optimization
Journal of Complexity, 2014Mohab Safey El Din +2 more
exaly
Exponential Time Complexity of the Permanent and the Tutte Polynomial
ACM Transactions on Algorithms, 2014Holger Dell +2 more
exaly