Results 71 to 80 of about 325,822 (315)

A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi   +17 more
wiley   +1 more source

A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem

open access: yes, 1973
Elsner L. A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem. Numerische Mathematik. 1973;21(5):425-427.By using Gershgorin's theorem and the theorems on minimal Gershgorin disks a posteriori error bounds for the ...
Elsner, Ludwig
core   +1 more source

Chain polynomials and Tutte polynomials

open access: yesDiscrete Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Symmetries of Polynomials

open access: yesJournal of Symbolic Computation, 2000
Let \(Q(x,y) = \sum_{i=0}^n a_ix^i y^{n-i}\) be a binary form of degree~\(n\) with real or complex coefficients \(a_i\). Classical invariant theory deals with the invariants of binary forms under the action of SL\(_2\). The article under review takes a different point of view.
Irina Berchenko, Peter J. Olver
openaire   +1 more source

Polynomially Bounded Sequences and Polynomial Sequences [PDF]

open access: yesFormalized Mathematics, 2015
Abstract In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12].
Hiroyuki Okazaki, Yuichi Futa
openaire   +2 more sources

T1 Over Squared Proton Density Ratio to Characterize Multiple Sclerosis Lesions

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Differentiating remyelinated from demyelinated lesions in MS remains challenging without histological confirmation. This study introduces the T1‐to‐PD2 ratio (TPR) imaging approach and evaluates its ability to characterize MS lesions alongside other quantitative MRI (qMRI) metrics. Methods Thirty individuals with MS (mean age: 47.5 ± 
Sarah J. Wright   +10 more
wiley   +1 more source

On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2016
Recently, the interest to polynomial representations of functions over finite fields and over finite rings is being increased. Complexity of those representations is widely studied.
A. Kazimirov, S. Reymerov
doaj  

Sharp inequalities of various metrics on the classes of functions with given comparison function

open access: yesResearches in Mathematics, 2021
For any $q > p > 0$, $\omega > 0,$ $d \ge 2 \omega,$ we obtain the following sharp inequality of various metrics $$ \|x\|_{L_q(I_{d})} \le \frac{\|\varphi + c\|_{L_q(I_{2\omega})}}{\|\varphi + c \|_{L_p(I_{2\omega})}} \|x\|_{L_p(I_{d})} $$ on the ...
T.V. Alexandrova, V.A. Kofanov
doaj   +1 more source

Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width

open access: yes, 1998
It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, Steven, S. D. Noble, Noble, S D
core   +1 more source

Problems with fixpoints of polynomials of polynomials

open access: yesCoRR
Accepted version at LICS26 taking into account reviewers' comments, plus various fixes and appendices.
Cécilia Pradic, Ian Price
openaire   +2 more sources

Home - About - Disclaimer - Privacy