LEADER 00817nam0-2200265 --450 001 9910598381803321 005 20221104113659.0 100 $a20221104d1954----kmuy0itay5050 ba 101 0 $aeng 102 $aUS 105 $a 001yy 200 1 $aSource readings in economic thought$fedited by Philip C. Newman, Arthur D. Gayer, Milton H. Spencer 210 $aNew York$cW. W. Norton & Company$d1954 215 $aIX, 762 p.$d24 cm 676 $a330.82$v19$zita 700 1$aNewman,$bPhilip Cahrles$0147868 701 1$aSpencer,$bMilton H.$0108578 701 1$aGayer,$bArthur David$0123328 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910598381803321 952 $aXV D 189$b47434$fFGBC 959 $aFGBC 996 $aSource readings in economic thought$92960443 997 $aUNINA LEADER 05318nam 22007455 450 001 996465379803316 005 20230329154301.0 010 $a3-319-03898-2 024 7 $a10.1007/978-3-319-03898-8 035 $a(CKB)3710000000031253 035 $a(DE-He213)978-3-319-03898-8 035 $a(SSID)ssj0001067782 035 $a(PQKBManifestationID)11681950 035 $a(PQKBTitleCode)TC0001067782 035 $a(PQKBWorkID)11094376 035 $a(PQKB)10451078 035 $a(MiAaPQ)EBC3093128 035 $a(PPN)176108726 035 $a(EXLCZ)993710000000031253 100 $a20131119d2013 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aParameterized and Exact Computation$b[electronic resource] $e8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers /$fedited by Gregory Gutin, Stefan Szeider 205 $a1st ed. 2013. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2013. 215 $a1 online resource (XII, 375 p. 28 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8246 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-03897-4 327 $aExact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle?s Theorem -- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria -- Algorithms for k-Internal Out-Branching. 330 $aThis book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013. The 29 revised full papers presented were carefully reviewed and selected from 58 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 computation, and implementation issues of parameterized and exact algorithms. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8246 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aMathematical Applications in Computer Science 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aMathematical Applications in Computer Science. 676 $a519.544 702 $aGutin$b Gregory$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSzeider$b Stefan$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465379803316 996 $aParameterized and Exact Computation$9772030 997 $aUNISA