01182nam a2200277 i 450099100047016970753620230428150754.0941118s1970 it 001 0 ita db10082359-39ule_instLE02516651Fac. Economiaita346.4502348.023Ghezzi, Giorgio227398Del contratto di agenzia :art. 1742-1753 /Giorgio GhezziBologna :Zanichelli ;Roma :Soc. ed. del Foro italiano,1970xxii, 276 p. ;25 cmCommentario del codice civile / a cura di Antonio Scialoja e Giuseppe Branca.Libro 4. : Delle obbligazioniContratti di agenzia.b1008235917-02-1727-06-02991000470169707536LE025 348 CCC/IV (ART.1742-1753)12025000015357le025-E0.00-no00000.i1009390427-06-02LE027 346.45 CCC01.04Art. 1742-1753 Ed. 197012027000288335le027-E0.00-lo00000.i1533376017-10-11Del contratto di agenzia195690UNISALENTOle025le02701-01-94ma-itait0103679nam 22007335 450 991048451340332120251226203210.03-319-13524-410.1007/978-3-319-13524-3(CKB)3710000000325023(SSID)ssj0001408337(PQKBManifestationID)11727569(PQKBTitleCode)TC0001408337(PQKBWorkID)11366810(PQKB)10547234(DE-He213)978-3-319-13524-3(MiAaPQ)EBC6296882(MiAaPQ)EBC5610438(Au-PeEL)EBL5610438(OCoLC)902703657(PPN)183152271(EXLCZ)99371000000032502320141202d2014 u| 0engurnn|008mamaatxtccrParameterized and Exact Computation 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers /edited by Marek Cygan, Pinar Heggernes1st ed. 2014.Cham :Springer International Publishing :Imprint: Springer,2014.1 online resource (IX, 343 p. 37 illus.) Theoretical Computer Science and General Issues,2512-2029 ;8894Bibliographic Level Mode of Issuance: Monograph3-319-13523-6 Fixed-parameter tractability results -- Parameterized complexity theory -- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms.This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, in Wroclaw, Poland, in September 2014. The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 42 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results; parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact exponential-time computation; and implementation issues of parameterized and exact exponential-time algorithms.Theoretical Computer Science and General Issues,2512-2029 ;8894Computer scienceAlgorithmsComputer scienceMathematicsDiscrete mathematicsComputer ScienceAlgorithmsDiscrete Mathematics in Computer ScienceMathematical Applications in Computer ScienceComputer science.Algorithms.Computer scienceMathematics.Discrete mathematics.Computer Science.Algorithms.Discrete Mathematics in Computer Science.Mathematical Applications in Computer Science.519.544Cygan Marekedthttp://id.loc.gov/vocabulary/relators/edtHeggernes Pinaredthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910484513403321Parameterized and Exact Computation772030UNINA