𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the computation of complex equilibria

✍ Scribed by Y. H. Ma; C. W. Shipman

Publisher
American Institute of Chemical Engineers
Year
1972
Tongue
English
Weight
577 KB
Volume
18
Category
Article
ISSN
0001-1541

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Symbolic Computation on Complex Polynomi
Symbolic Computation on Complex Polynomial Solution of Differential Equations
✍ Jun Zhang πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 447 KB

A symbolic computation scheme, based on the Lanczos Ο„ -method, is proposed for obtaining exact polynomial solutions to some perturbed differential equations with suitable boundary conditions. The automated Ο„ -method uses symbolic Faber polynomials as the perturbation terms for arbitrary circular sec

Computational complexity on computable m
Computational complexity on computable metric spaces
✍ Klaus Weirauch πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

## Abstract We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a gene

On the complexity of categoricity in com
On the complexity of categoricity in computable structures
✍ Walker M. White πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 192 KB

## Abstract We investigate the computational complexity the class of Γ‐categorical computable structures. We show that hyperarithmetic categoricity is Ξ ^1^~1~‐complete, while computable categoricity is Ξ ^0^~4~‐hard. (Β© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Complexity Limitations on Quantum Comput
Complexity Limitations on Quantum Computation
✍ Lance Fortnow; John Rogers πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 141 KB

We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP: BQP is low for PP, i.e., PP BQP =PP; There exists a relativized, world, where P=BQP and t