*0011572183
*008090914s2008    xx#           000 0 eng
*019  $bk
*08230$a005.131
*08230$a511.3
*100  $aCieliebak, Mark$uETH Zürich, Institute of Theoretical Computer Science, Zürich, Switzerland ; mark@dreamboxx.com$_166314400
*245  $aOn the complexity of variations of equal sum subsets
*300  $aS. [151]-172
*500  $aVitenskapelig artikkel
*5208 $aInneholder sammendrag
*650  $aAlgoritmer$2norart$_23241100
*650  $ainformasjonsteknologi (IT)$9nor$2norart$_128598800
*650  $aprogrammering$9nor$2norart$_130429300
*653  $aequal sum subsets$9eng$_166314500
*653  $aknapsack problems$9eng$_166314600
*653  $apartition$9eng$_136899200
*653  $apseudo-polynomial algorithms$9eng$_166314700
*653  $astrong NP-completeness$9eng$_166314800
*700  $aEidenbenz, Stephan;$uLos Alamos National Laboratory, Los Alamos : eidenben@lanl.gov$_166314900
*700  $aPagourtzis, Aris T.;$uNational Technical University of Athens, School of Electrical and Computing Engineering, Athens, Greece : pagour@cs.ntua.gr$_166315000
*700  $aSchlude, Konrad$uETH Zürich, Institute of Theoretical Computer Science, Zürich, Switzerland : schlude@inf.ethz.ch$_166315100
*773  $tNordic journal of computing$gVol. 14, nr. 3 (2008)$x1236-6064$w(NO-LaBS)69800(tnr)
*999  $z900456766$anorart:900456766
^