Results 251 to 260 of about 45,723 (298)

Endoscopic Lung Volume Reduction with Valves Improves Cardiovascular Adaptability and 6-MWT Performance in Severely Limited COPD Patients. [PDF]

Int J Chron Obstruct Pulmon Dis
Farber L, Pappe E, Sgarbossa T, Neumann K, Witzenrath M, Hübner RH, Saccomanno J.   +6 more
europepmc   +1 more source

Comparative genomics of microalgae: molecular mechanisms underlying efficient CO₂ assimilation. [PDF]

BMC Genomics
Di Martino J, Liberati F, Carrus M, Arcieri M, Arcioni L, Bottoni P, Cafaro C, De Giorgi L, Fardelli A, Franchini P, Canestrelli D, Castrignanò T.   +11 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Completeness Criterion for Spectra

SIAM Journal on Computing, 1977
A spectrum is an algebraic representation of a set of “switching elements” each of which carries out an operation in a definite time lag. The notion of functional completeness ($\sim $-completeness) in the family of spectra was introduced by V. B. Kudryavcev and A. Nozaki.
Teruo Hikita, Akihiro Nozaki
exaly   +2 more sources

Completeness Criterion in Class of Exponential-Polynomial Functions

Moscow University Computational Mathematics and Cybernetics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S S Marchenkov, Marchenkov S S
exaly   +3 more sources

A completeness criterion for Kaniadakis, Abe and two-parameter generalized statistical theories [PDF]

Reports on Mathematical Physics, 2010
We recently provided a criterion of completeness valid for any generalized thermostatistics to check whether they form a bijection from R+/R (set of positive real numbers/all real numbers) to R/R+ in a previous paper.
Thomas Oikonomou, G Baris BAĞCI
exaly   +2 more sources

A GENERALISATION OF SLUPECKI'S CRITERION FOR FUNCTIONAL COMPLETENESS

Mathematical Logic Quarterly, 1984
\textit{J. Słupecki} [C. R. Soc. Sci. Varsovie 32, 102-109 (1939)] showed that any set of functors of the m-valued propositional calculus \((3\leq ...
Barbara J. Lowesmith, Alan Rose
openaire   +1 more source

On a criterion of NP-completeness

Ukrainian Mathematical Journal, 1998
We consider the problem of construction of criteria of completeness of sets with respect to polynomially bounded reducibilities. We present a nonstandard description of sets from the class NP, a brief proof of an analog of the well-known Cook theorem, and a criterion of NP-completeness.
V. K. Bulitko, V. V. Bulitko
openaire   +1 more source

A criterion of functional completeness for $$\mathfrak{B}^3 $$

Studia Logica, 1974
exaly   +3 more sources

A Completeness Criterion for Inner Product Spaces

Bulletin of the London Mathematical Society, 1987
Let P be an inner product space. The authors show that P is complete \((=\) Hilbert) if and only if the lattice L(P) of all strongly closed subspaces of P possesses at least one state.
Hamhalter, J., Pták, P.
openaire   +2 more sources