03609nam 22007335 450 99646531070331620230329205814.03-642-30891-010.1007/978-3-642-30891-8(CKB)3400000000085317(SSID)ssj0000697565(PQKBManifestationID)11453809(PQKBTitleCode)TC0000697565(PQKBWorkID)10691419(PQKB)10889252(DE-He213)978-3-642-30891-8(MiAaPQ)EBC3070622(PPN)168317966(EXLCZ)99340000000008531720120615d2012 u| 0engurnn#008mamaatxtccrThe Multivariate Algorithmic Revolution and Beyond[electronic resource] Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday /edited by Hans L. Bodlaender, Rodney Downey, Fedor V. Fomin, Dániel Marx1st ed. 2012.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2012.1 online resource (XXII, 506 p. 32 illus.)Theoretical Computer Science and General Issues,2512-2029 ;7370Bibliographic Level Mode of Issuance: Monograph3-642-30890-2 Includes bibliographical references and author index.Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.Theoretical Computer Science and General Issues,2512-2029 ;7370AlgorithmsComputer science—MathematicsDiscrete mathematicsComputer scienceMachine theoryAlgorithmsDiscrete Mathematics in Computer ScienceTheory of ComputationFormal Languages and Automata TheoryComputer Science Logic and Foundations of ProgrammingAlgorithms.Computer science—Mathematics.Discrete mathematics.Computer science.Machine theory.Algorithms.Discrete Mathematics in Computer Science.Theory of Computation.Formal Languages and Automata Theory.Computer Science Logic and Foundations of Programming.005.1Bodlaender Hans Ledthttp://id.loc.gov/vocabulary/relators/edtDowney Rodneyedthttp://id.loc.gov/vocabulary/relators/edtFomin Fedor Vedthttp://id.loc.gov/vocabulary/relators/edtMarx Dánieledthttp://id.loc.gov/vocabulary/relators/edtBOOK996465310703316The Multivariate Algorithmic Revolution and Beyond2829917UNISA01434nam a2200385 i 450099100120819970753620020507185242.0950626s1981 us ||| | eng 0471080578b10815727-39ule_instLE01308707ExLDip.to Matematicaeng519.76AMS 90C25AMS 90C26AMS 90C30T57.8Ben-Israel, Adi481531Optimality in nonlinear programming :a feasible directions approach /A. Ben-Israel, A. Ben-Tal, S. ZlobecNew York :c1981xii, 144 p. :ill. ;24 cm.Pure and applied mathematics. A wiley-interscience series of texts, monographs & tracts, ISSN 00798185"A Wiley-Interscience publication".Bibliography: p. 135-140Convex programmingMathematical optimizationNonlinear programmingBen-Tal, A.Zlobec, S.authorhttp://id.loc.gov/vocabulary/relators/aut54401.b1081572723-02-1728-06-02991001208199707536LE013 90C BEN11 (1981)12013000031293le013-E0.00-l- 00000.i1092234928-06-02Optimality in nonlinear programming1455870UNISALENTOle01301-01-95ma -engus 0101348nam 2200481 a 450 991078522190332120210210024730.02-7592-0627-0(CKB)2670000000054897(EBL)3398969(SSID)ssj0000881447(PQKBManifestationID)11528059(PQKBTitleCode)TC0000881447(PQKBWorkID)10913286(PQKB)10547072(WaSeSS)Ind00058425(MiAaPQ)EBC4539888(PPN)16333952X(PPN)170261018(EXLCZ)99267000000005489720130425d2010 uy 0freur|n|---|||||txtccrLa planète Fleurs[electronic resource] /Gérard GuillotVersailles Éditions Quæ20101 online resource (211 p.)Carnets de sciencesDescription based upon print version of record.2-7592-0626-2 Includes bibliographical references.FlowersFlowers.Guillot Gérard194526MiAaPQMiAaPQMiAaPQBOOK9910785221903321La planète Fleurs3732190UNINA