| Автор | J Daniel Christensen |
| Автор | Greg Egan |
| Дата выпуска | 2002-03-21 |
| dc.description | The 10j symbol is a spin network that appears in the partition function for the Barrett–Crane model of Riemannian quantum gravity. Elementary methods of calculating the 10j symbol require O(j<sup>9</sup>) or more operations and O(j<sup>2</sup>) or more space, where j is the average spin. We present an algorithm that computes the 10j symbol using O(j<sup>5</sup>) operations and O(j<sup>2</sup>) space, and a variant that uses O(j<sup>6</sup>) operations and a constant amount of space. An implementation has been made available on the web. |
| Формат | application.pdf |
| Издатель | Institute of Physics Publishing |
| Название | An efficient algorithm for the Riemannian 10j symbols |
| Тип | paper |
| DOI | 10.1088/0264-9381/19/6/310 |
| Electronic ISSN | 1361-6382 |
| Print ISSN | 0264-9381 |
| Журнал | Classical and Quantum Gravity |
| Том | 19 |
| Первая страница | 1185 |
| Последняя страница | 1193 |
| Выпуск | 6 |
