|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
M. O. Ball and U. Derigs, An analysis of alternate strategies for implementing matching algorithms, Networks 13, 517-549, 1983.
|
| |
2
|
A.I. Barvinok, Computing Mixed Discriminants, Mixed Volumes, and Pemanents, Discrete & Computational Geometry, 18 (1997), 205-237.
|
| |
3
|
A. I. Barvinok, A simple polynomial time algorithm to approximate the permanent within a simply exponential factor, preprint, 1998.
|
| |
4
|
L. M. Bregman, Certain properties of nonnegative matrices and their permanents, Soviet Math. Dold. 14, 945-949, 1973.
|
| |
5
|
D. T. Brown, A note on approximations of discrete probability distributions, Inform. and Control, 2, 386-392, 1959.
|
| |
6
|
G.P. Egorychev, The solution of van der ~Vaerden's problem for permanents, Advances in Math., 42, 299-305, 1981.
|
| |
7
|
D. I. Falikman, Proof of the van der ~Vaerden's conjecture on the permanent of a doubly stochastic matrix, Mat. Zamettd 29, 6: 931-938, 957, 1981, (in Russian).
|
 |
8
|
|
| |
9
|
S. E. Fienberg, The Analysis of Cross Classified Data, MIT press, Cambridge, MA, 1977.
|
| |
10
|
J. Franklin and J. Lorenz, On the scaling of multidimensional matrices, Linear Algebra Appl. 114/115, 717-735, 1989.
|
| |
11
|
S. Friedland, C. Li, H, Schneider, Additive Decomposition of Nonnegative Matrices with Applications to Permanents and Scaling, Linear ~d Multilinear Algebra,23, 63-75, 1988.
|
| |
12
|
G. T. Herman and A. Lint, Iterative reconstruction algorithms, Comput. Biol. Med. 6, 276, 1976.
|
| |
13
|
|
| |
14
|
M. Jerrum and U. Vazirani, A mildly exponential approximation algorithm for the permanent, ,'klgorithmica, 16(4,/5), 392-401, 1996.
|
| |
15
|
P. W. Kasteleyn, The statistics of dimers on a lattice 1. The number of dimer arrangements on a quadratic lattice. Physica, 27, 1209-1225, 1961.
|
| |
16
|
B. Kalantari and L Khachian, On the complexity of nonnegative matrix scaling, Linear Algebra AppI., 240, 87-104, 1996.
|
| |
17
|
|
| |
18
|
R M Karp , E Upfal , A Wigderson, Are search and decision programs computationally equivalent?, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.464-475, May 06-08, 1985, Providence, Rhode Island, United States
[doi> 10.1145/22145.22197]
|
| |
19
|
L. Lo~sz, On determinants, matchings and random algorithms, Fundamentals of computing theor55 edited by L. Budach, Akademia-Verlag, Berlin 1979.
|
| |
20
|
L. Lo~sz and M. D. Plummer, Matching Theory, North Holland, Amsterdam 1986.
|
| |
21
|
N. l~Iegiddo, Towards a genuinly polynomial algorithm for linear pro~amming, SIAM Journal on Computing, 12(2), 347-353, 1983.
|
| |
22
|
T. E. S. Raghavan, On pairs of multidimensional matrices, Linear Algebra Appl. 62, 263- 268, 1984.
|
| |
23
|
U. Rothblum and H. Schneider, Scaling of matrices which have prespecified row sums and column sums via optimization, Linear Algebra Appl. 114/'115, 737-764, 1989.
|
| |
24
|
R. Sinkhorn, A relationsMp between arbitrary positive matrices and doubly stochastic matrices, Ann. Math. Statist. 35, 876-879, 1964.
|
| |
25
|
L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, $(2), 189-201, 1979.
|
| |
26
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.2