๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A reduction theorem for normal algorithms

โœ Scribed by R. M. Baer

Publisher
John Wiley and Sons
Year
1969
Tongue
English
Weight
210 KB
Volume
15
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Algorithms for Petersen's Matc
Efficient Algorithms for Petersen's Matching Theorem
โœ Therese C. Biedl; Prosenjit Bose; Erik D. Demaine; Anna Lubiw ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 293 KB

Petersen's theorem is a classic result in matching theory from 1891, stating that every 3-regular bridgeless graph has a perfect matching. Our work explores efficient algorithms for finding perfect matchings in such graphs. Previously, the only relevant matching algorithms were for general graphs, a

A New Algorithm for NMR Spectral Normali
A New Algorithm for NMR Spectral Normalization
โœ Rocco Romano; Raffaele Lamanna; Maria Teresa Santini; Pietro Luigi Indovina ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 105 KB

There is increasing use of high-resolution NMR spectroscopy to examine variations in cell metabolism and/or structure in response to numerous physical, chemical, and biological agents. In these types of studies, in order to obtain relative quantitative information, a comparison between signal intens

A Time-Domain Algorithm for NMR Spectral
A Time-Domain Algorithm for NMR Spectral Normalization
โœ Rocco Romano; Maria Teresa Santini; Pietro Luigi Indovina ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

Recently, a new method for quantitatively comparing NMR spectra of control and treated samples, in order to examine the possible occurring variations in cell metabolism and/or structure in response to numerous physical, chemical, and biological agents, was proposed. This method is based upon the uti