𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Toward mechanical analysis of the computational complexity of algorithms

✍ Scribed by G. P. Kozhevnikova

Publisher
Springer US
Year
1980
Tongue
English
Weight
882 KB
Volume
16
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity analysis of the SAT engine: D
Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms
✍ Masami Hagiya; John A. Rose; Ken Komiya; Kensaku Sakamoto πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 123 KB

Taking advantage of the power of DNA molecules to spontaneously form hairpin structures, Sakamoto et al. designed a molecular algorithm to solve instances of the satisΓΏability problem on Boolean expressions in clausal form (the SAT problem), and by developing new experimental techniques for molecula

Toward a Generalized Algorithm for the A
Toward a Generalized Algorithm for the Automated Analysis of Complex Anisotropic NMR Spectra
✍ F. Castiglione; M. Carravetta; G. Celebre; M. Longeri πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 217 KB

## An existing algorithm, founded on the works of Stephenson and There is a basic difference between the traditional CB-B Binsch, for the automatic analysis of isotropic or simple anisoapproach and automatic analysis programs since, in the fortropic NMR spectra has been improved to treat very comp

The Computational Complexity of Choice S
The Computational Complexity of Choice Sets
✍ Felix Brandt; Felix Fischer; Paul Harrenstein πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the __Condorcet criterion__, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of