Author:
Karp R. M.,Upfal E.,Wigderson A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference16 articles.
1. D. Angluin andL. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings.J. of Comp. Syst. Sci. 18 (1979), 155–193.
2. A. Borodin, S. A. Cook andN. Pippenger, Parallel computation for well-endowed rings and space bounded probabilistic machines.Information and Control 58 (1983), 113–136.
3. A. Borodin, J. von zur Gathen andJ. Hopcroft, Fast parallel matrix and GCD computations.Proc. 23 STOC (1982), 65–71.
4. S. A. Cook, An overview of computation complexity.CACM 26 (1983), 400–408.
5. J. Edmonds, Systems of distinct representatives and linear algebra.J. of Res. Nat. Bureau of Standards,71 A (1967), 241–245.
Cited by
169 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献