LEADER 00700nam2 22002171i 450 001 990002251900403321 035 $a000225190 035 $aFED01000225190 035 $a(Aleph)000225190FED01 035 $a000225190 100 $a20030801d--------km-y0itay50------ba 200 1 $aChemical communication in the guines pig$eurinary components of low volatility andtheir access to the vomeronasal organ. NewYork-London, 1980, p. 327-339. 463 0$1001000222353 701 1$aBeauchamp,$bGary K.$093310 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990002251900403321 959 $aFFABC 996 $aChemical communication in the guines pig$9399013 997 $aUNINA DB $aING01 LEADER 01953nam 2200457 450 001 000013623 005 20050718115500.0 100 $a20030522d--------km-y0itay0103----ba 101 0 $aita 102 $aIT 200 1 $aDisegno di macchine$ead uso didattico e pratico per ingegneri, progettisti, disegnatori e tecnici$fFederico Filippi 210 $aMilano$cHoepli 215 $av.$d28 cm. 327 0 $aVol. 1. : Elementi di disegno meccanico. - c1977. - XII, 471 p 327 0 $aVol. 2. : Organi di collegamento. - c1978. - 561 p 559 1 $aElementi di disegno meccanico 559 1 $aOrgani di collegamento 606 $aMacchine$xDisegno 676 $a604.2$v(21. ed.)$9Disegno tecnico 700 1$aFilippi,$bFederico$0764 801 0$aIT$bUniversitą della Basilicata - B.I.A.$gRICA$2unimarc 912 $a000013623 996 $aDisegno di macchine$981544 997 $aUNIBAS BAS $aMONING BAS $aINGEGNERIA CAT $aSTD024$b01$c20030522$lBAS01$h1319 CAT $aTORRE$b20$c20040422$lBAS01$h1633 CAT $aTORRE$b20$c20040422$lBAS01$h1634 CAT $aTORRE$b20$c20040422$lBAS01$h1635 CAT $aTORRE$b20$c20050420$lBAS01$h1321 CAT $aTORRE$b20$c20050420$lBAS01$h1327 CAT $aTORRE$b20$c20050420$lBAS01$h1333 CAT $c20050601$lBAS01$h1755 CAT $abatch$b01$c20050718$lBAS01$h1051 CAT $c20050718$lBAS01$h1111 CAT $c20050718$lBAS01$h1141 CAT $c20050718$lBAS01$h1155 FMT Z30 -1$lBAS01$LBAS01$mBOOK$1BASA2$APolo Tecnico-Scientifico$2DID$BDidattica$3PTS.s3.p33.8$657058$5I57058$820030522$b1$eXII, 471$f04$FPrestabile Didattica$hVol. 1.: Elementi di disegno meccanico : parte I: nozioni fondamentali.. Z30 -1$lBAS01$LBAS01$mBOOK$1BASA2$APolo Tecnico-Scientifico$2DID$BDidattica$3PTS.s3.p33.9$657059$5I57059$820030522$b2$e561$f04$FPrestabile Didattica$hVol. 2.: Organi di collegamento : parte III: organi di collegamento.. LEADER 03135nam 2200457 450 001 996546840903316 005 20230730235921.0 010 $a9789811999529$b(electronic bk.) 010 $z9789811999512 024 7 $a10.1007/978-981-19-9952-9 035 $a(MiAaPQ)EBC7220723 035 $a(Au-PeEL)EBL7220723 035 $a(OCoLC)1374428713 035 $a(DE-He213)978-981-19-9952-9 035 $a(PPN)269100466 035 $a(EXLCZ)9926347416400041 100 $a20230730d2023 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aPedigree polytopes $enew insights on computational complexity of combinatorial optimization problems /$fTirukkattuppalli Subramanyam Arthanari 205 $a1st ed. 2023. 210 1$aSingapore :$cSpringer,$d[2023] 210 4$d©2023 215 $a1 online resource (235 pages) 311 08$aPrint version: Arthanari, Tirukkattuppalli Subramanyam Pedigree Polytopes Singapore : Springer,c2023 9789811999512 320 $aIncludes bibliographical references and index. 327 $aChapter 1: Prologue -- Chapter 2: Notations, Definitions and Briefs -- Chapter 3: Motivation for Studying Pedigrees -- Chapter 4: Structure of the Pedigree Polytope -- Chapter 5: Membership Checking in Pedigree Polytopes -- Chapter 6: Computational Complexity of Membership Checking -- Chapter 7: Efficient Checking of Membership in Pedigree Polytope and its Implications -- Chapter 8: Epilogue. 330 $aThis book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution. This book challenges the popularly held belief in computer science that a problem included in the NP-complete class may not have a polynomial algorithm to solve. By showing STSP has a polynomial algorithm, this book settles the P vs NP question. This book has illustrative examples, figures, and easily accessible proofs for showing this unexpected result. This book introduces novel constructions and ideas previously not used in the literature. Another interesting feature of this book is it uses basic max-flow and linear multicommodity flow algorithms and concepts in these proofs establishing efficient membership checking for the pedigree polytope. Chapters 3-7 can be adopted to give a course on Efficient Combinatorial Optimization. This book is the culmination of the author's research that started in 1982 through a presentation on a new formulation of STSP at the XIth International Symposium on Mathematical Programming at Bonn. 606 $aPolytopes 615 0$aPolytopes. 676 $a895.134 700 $aArthanari$b Tirukkattuppalli Subramanyam$01349112 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a996546840903316 996 $aPedigree Polytopes$93087046 997 $aUNISA