Gregory E. Coxson

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

1999

2 EE Gregory E. Coxson: Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-Hard. Reliable Computing 5(2): 137-142 (1999)

1994

1 Gregory E. Coxson: The P-matrix problem is co-NP-complete. Math. Program. 64: 173-178 (1994)

1999
2	EE	Gregory E. Coxson: Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-Hard. Reliable Computing 5(2): 137-142 (1999)
1994
1		Gregory E. Coxson: The P-matrix problem is co-NP-complete. Math. Program. 64: 173-178 (1994)