A three-complex-parameter class of orthogonal Laurent polynomials on the unit circle associated with basic hypergeometric or q-hypergeometric functions is considered. To be precise, we consider the ...
Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback