✦ LIBER ✦

Table approximations to recursive predicates

✍ Scribed by R. I. Freidzon

Publisher: Springer US
Year: 1977
Tongue: English
Weight: 389 KB
Volume: 8
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01091555

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular approximations of recursive pred

Regular approximations of recursive predicates

✍ R. I. Freidzon 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 518 KB

Approximate completeness in algebras of

Approximate completeness in algebras of partial recursive functions and predicates

✍ Yu. V. Golunkov 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 563 KB

Recursion method solution of coherent po

Recursion method solution of coherent potential approximation equations: application to surface alloys

✍ M Brejnak; JP Julien; D Mayou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Rapid approximation to molecular surface

Rapid approximation to molecular surface area via the use of Boolean logic and look-up tables

✍ Scott M. Le Grand; Kenneth M. Merz Jr. 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

## Abstract We report the development of a new approximate method of calculating molecular surface areas. Our technique is based upon the method of Sharake and Rupley but incorporates several major advances. First, we represent the state of surface points as bits in a bit string so we can utilize B

A polynomial-time algorithm to approxima

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

✍ Mary Cryan; Martin Dyer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 232 KB

We consider the problem of counting the number of contingency tables with given row and column sums. This problem is known to be #P-complete, even when there are only two rows (Random Structures Algorithms 10(4) (1997) 487). In this paper we present the first fully polynomial randomized approximatio

Corrigendum to “Recursive formulation of

Corrigendum to “Recursive formulation of the matrix Padé approximation in packed storage” [Comput. Math. Appl. 59 (2010) 1532–1540]

✍ M. Kaliyappan; S. Ponnusamy; S. Sundar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 148 KB

On page 1533 Eq. ( ) should read: '' On page 1535, in the algorithm, RP\_RITM(A), step 2 should read: ''A ← 1/A'' instead of ''A = 1/A'' and in the algorithm, RP\_TMTMM(A, B), step 2 should read ''C ← A × B'' instead of ''C = A × B''.