Author:
Coullard Collette R.,Hellerstein Lisa
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. D. Angluin, L. Hellerstein, andM. Karpinski: Learning read-once formulas with queries,J. of the Association for Computing Machinery 40 (1993) 185–210.
2. N. Bshouty, T. Hancock, L. Hellerstein, andM. Karpinski: An algorithm to learn read-once threshold formulas, and transformations between learning models,Computational Complexity 4 (1994) 37–61.
3. R. E. Bixby: Matroids and operations research. in:Advanced Techniques in the Practice of Operations Research, (H. J. Greenberg, F. H. Murphy, and S. H. Shaw, eds.), North-Holland Publishers (1980) 333–459.
4. R. E. Bixby, andW. H. Cunningham: Converting linear programs to network problems,Mathematics of Operations Research 5 (1980) 321–357.
5. R. E. Bixby, andD. K. Wagner: An almost linear time algorithm for graph realization,Mathematics of Operations Research 13 (1988) 99–123.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献