Is OT NP-hard

Kornai, András (2006) Is OT NP-hard.

Text
Kornai_2165086_ny.pdf
Download (53kB)

Item Type:	Other
Additional Information:	Rutgers Optimality Archive
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User:	EPrints Admin
Date Deposited:	26 Aug 2014 14:06
Last Modified:	09 Oct 2014 05:46
URI:	https://eprints.sztaki.hu/id/eprint/7906

Update Item