dc.contributor.author |
PAPADIMITRIOU, CH |
en |
dc.date.accessioned |
2014-03-01T01:38:21Z |
|
dc.date.available |
2014-03-01T01:38:21Z |
|
dc.date.issued |
1981 |
en |
dc.identifier.issn |
0004-5411 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/22069 |
|
dc.subject.classification |
Computer Science, Hardware & Architecture |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.classification |
Computer Science, Software Engineering |
en |
dc.subject.classification |
Computer Science, Theory & Methods |
en |
dc.title |
ON THE COMPLEXITY OF INTEGER PROGRAMMING |
en |
heal.type |
journalArticle |
en |
heal.language |
English |
en |
heal.publicationDate |
1981 |
en |
heal.publisher |
ASSOC COMPUTING MACHINERY |
en |
heal.journalName |
JOURNAL OF THE ACM |
en |
dc.identifier.isi |
ISI:A1981ML20600011 |
en |
dc.identifier.volume |
28 |
en |
dc.identifier.issue |
4 |
en |
dc.identifier.spage |
765 |
en |
dc.identifier.epage |
768 |
en |