Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
ohiou1184355429.pdf (3.01 MB)
ETD Abstract Container
Abstract Header
Algorithms for parallel and sequential matrix-chain product problem
Author Info
Wang, Ting
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1184355429
Abstract Details
Year and Degree
1997, Master of Science (MS), Ohio University, Electrical Engineering & Computer Science (Engineering and Technology).
Abstract
Algorithms for parallel and sequential matrix-chain product problem
Committee
David Juedes (Advisor)
Pages
54 p.
Keywords
Matrix Chain Product
;
Polynomial Algorithm
;
Parallel Polygon Triangulation
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Wang, T. (1997).
Algorithms for parallel and sequential matrix-chain product problem
[Master's thesis, Ohio University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1184355429
APA Style (7th edition)
Wang, Ting.
Algorithms for parallel and sequential matrix-chain product problem.
1997. Ohio University, Master's thesis.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1184355429.
MLA Style (8th edition)
Wang, Ting. "Algorithms for parallel and sequential matrix-chain product problem." Master's thesis, Ohio University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1184355429
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
ohiou1184355429
Download Count:
4,621
Copyright Info
© 1997, all rights reserved.
This open access ETD is published by Ohio University and OhioLINK.