LEADER 01299nam--2200409---450- 001 990005781330203316 005 20121119110918.0 010 $a978-88-420-9416-6 035 $a000578133 035 $aUSA01000578133 035 $a(ALEPH)000578133USA01 035 $a000578133 100 $a20121119d2012----km-y0itay50------ba 101 $aita 102 $aIT 105 $a||||||||001yy 200 1 $a<> mite civilizzatore delle nazioni$eascesa e caduta del diritto internazionale 1870-1960$fMartti Koskenniemi$ga cura di Gustavo Gozzi, Lorenzo Gradoni e Paolo Turrini 210 $aRoma$aBari$cLaterza$d2012 215 $aXXVIII, 697 p.$d24 cm 225 2 $aStoria e società 410 0$12001$aStoria e società 454 1$12001 606 0 $aDiritto internazionale$2BNCF 676 $a1870-1960 700 1$aKOSKENNIEMI,$bMartti$0257232 702 1$aGOZZI,$bGustavo 702 1$aGRADONI,$bLorenzo 702 1$aTURRINI,$bPaolo 801 0$aIT$bsalbc$gISBD 912 $a990005781330203316 951 $aXXIII.1.C. 218$b238906 L.M.$cXXIII.1.C.$d00317495 959 $aBK 969 $aUMA 979 $aALESSANDRA$b90$c20121119$lUSA01$h1105 979 $aALESSANDRA$b90$c20121119$lUSA01$h1109 996 $aMite civilizzatore delle nazioni$9825430 997 $aUNISA LEADER 02985nam 22006855 450 001 9910506406003321 005 20251225180420.0 010 $a3-030-89716-8 024 7 $a10.1007/978-3-030-89716-1 035 $a(CKB)5340000000068435 035 $a(MiAaPQ)EBC6792461 035 $a(Au-PeEL)EBL6792461 035 $a(OCoLC)1281240105 035 $a(DE-He213)978-3-030-89716-1 035 $a(PPN)258296526 035 $a(EXLCZ)995340000000068435 100 $a20211025d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aReachability Problems $e15th International Conference, RP 2021, Liverpool, UK, October 25?27, 2021, Proceedings /$fedited by Paul C. Bell, Patrick Totzke, Igor Potapov 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (181 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13035 311 08$a3-030-89715-X 327 $aInvited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.-. 330 $aChapter ?Recent Advances on Reachability Problems for Valence Systems? is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13035 606 $aComputer science 606 $aArtificial intelligence 606 $aSoftware engineering 606 $aComputer engineering 606 $aComputer networks 606 $aTheory of Computation 606 $aArtificial Intelligence 606 $aSoftware Engineering 606 $aComputer Engineering and Networks 615 0$aComputer science. 615 0$aArtificial intelligence. 615 0$aSoftware engineering. 615 0$aComputer engineering. 615 0$aComputer networks. 615 14$aTheory of Computation. 615 24$aArtificial Intelligence. 615 24$aSoftware Engineering. 615 24$aComputer Engineering and Networks. 676 $a004 702 $aBell$b Paul C. 702 $aTotzke$b Patrick 702 $aPotapov$b Igor 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910506406003321 996 $aReachability Problems$93573647 997 $aUNINA