LEADER 01036nam a2200265 i 4500 001 991000896369707536 008 060821s2006 it a b 000 0 ita d 020 $a9788851003630 035 $ab13928703-39ule_inst 040 $aDip.to Beni Arti e Storia$bita 245 00$aAntonello da Messina :$bSan Girolamo nello studio /$ca cura di Gioacchino Barbera. 246 30$aSan Girolamo nello studio. 260 $aNapoli :$bElecta,$c2006. 300 $a48 p. :$bill. ;$c28 cm. 504 $aBibliografia: p. 46-48. 600 04$aAntonello,$cda Messina,$dca. 1430-1479$vMostre. 600 04$aGerolamo,$csanto,$dca. 347-420$xIconografia. 700 0 $aAntonello,$cda Messina,$dca. 1430-1479. 700 1 $aBarbera, Gioacchino. 907 $a.b13928703$b28-01-14$c19-10-10 912 $a991000896369707536 945 $aLE019 A25 AR F 27$g1$i2019000064026$lle019$og$pE15.00$q-$rl$s- $t0$u3$v1$w3$x0$y.i1518500x$z19-10-10 996 $aAntonello da Messina$9249312 997 $aUNISALENTO 998 $ale019$b19-10-10$cm$da $e-$fita$git $h0$i0 LEADER 07697nam 22008655 450 001 9910484749503321 005 20251226193426.0 010 $a1-280-38852-8 010 $a9786613566447 010 $a3-642-15369-0 024 7 $a10.1007/978-3-642-15369-3 035 $a(CKB)2670000000036401 035 $a(SSID)ssj0000446302 035 $a(PQKBManifestationID)11297662 035 $a(PQKBTitleCode)TC0000446302 035 $a(PQKBWorkID)10495992 035 $a(PQKB)11323440 035 $a(DE-He213)978-3-642-15369-3 035 $a(MiAaPQ)EBC3065732 035 $a(PPN)149018363 035 $a(BIP)32049132 035 $a(EXLCZ)992670000000036401 100 $a20100827d2010 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques $e13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings /$fedited by Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XIII, 782 p. 54 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6302 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-15368-2 320 $aIncludes bibliographical references and index. 327 $aContributed Talks of APPROX -- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem -- Improved Inapproximability for Submodular Maximization -- Approximation Algorithms for the Directed k-Tour and k-Stroll Problems -- Submodular Secretary Problem and Extensions -- Approximation Algorithms for Min-Max Generalization Problems -- Min-Power Strong Connectivity -- The Complexity of Approximately Counting Stable Matchings -- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs -- Approximating Linear Threshold Predicates -- Approximating Sparsest Cut in Graphs of Bounded Treewidth -- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors -- Vertex Sparsifiers: New Results from Old Techniques -- PTAS for Weighted Set Cover on Unit Squares -- Improved Lower Bounds for the Universal and a priori TSP -- Proximity Algorithms for Nearly-Doubling Spaces -- Matrix Sparsification and the Sparse Null Space Problem -- The Checkpoint Problem -- The Euclidean Distortion of Flat Tori -- Online Embeddings -- Approximation Algorithms for Intersection Graphs -- An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs -- Improved Algorithm for the Half-Disjoint Paths Problem -- Approximate Lasserre Integrality Gap for Unique Games -- Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses -- Maximum Flows on Disjoint Paths -- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization -- How to Schedule When You Have to Buy Your Energy -- Improving Integrality Gaps via Chvátal-Gomory Rounding -- Contributed Talks of RANDOM -- Uniform Derandomization from Pathetic Lower Bounds -- Testing Boolean FunctionIsomorphism -- Better Size Estimation for Sparse Matrix Products -- Low Rate Is Insufficient for Local Testability -- Reconstruction Threshold for the Hardcore Model -- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners -- Monotonicity Testing and Shortest-Path Routing on the Cube -- Better Gap-Hamming Lower Bounds via Better Round Elimination -- Propagation Connectivity of Random Hypergraphs -- Improved Pseudorandom Generators for Depth 2 Circuits -- The Structure of Winning Strategies in Parallel Repetition Games -- Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries -- Periodicity in Streams -- Rumor Spreading on Random Regular Graphs and Expanders -- On Testing Computability by Small Width OBDDs -- Learning and Lower Bounds for AC 0 with Threshold Gates -- Liftings of Tree-Structured Markov Chains -- Constructive Proofs of Concentration Bounds -- Almost-Euclidean Subspaces of via Tensor Products: A Simple Approach to Randomness Reduction -- Testing Outerplanarity of Bounded Degree Graphs -- Two-Source Extractors Secure against Quantum Adversaries -- Locally Testable vs. Locally Decodable Codes -- Differential Privacy and the Fat-Shattering Dimension of Linear Queries -- Two Theorems on List Decoding -- Delaying Satisfiability for Random 2SAT -- Improved Rounding for Parallel Repeated Unique Games -- A Query Efficient Non-adaptive Long Code Test with Perfect Completeness -- Relativized Worlds without Worst-Case to Average-Case Reductions for NP -- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field. 330 $aThis volume contains the papers presented at the 13th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010) and the 14th International Workshop on Randomization and Computation (RANDOM 2010), which took place concurrently in Universitat Polite?cnica de Catalunya (UPC) Barcelona, Spain, during September 1-3, 2010. APPROX focuses on algorithmic and complexity issues surrounding the dev- opment of e'cient approximate solutions to computationally di'cult problems, and was the 13th in the series after Aalborg (1998), Berkeley (1999), Sa- bru?cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), Boston (2008) and Berkeley (2009). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 14th workshop in the - ries following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), Boston (2008), and Berkeley (2009). 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6302 606 $aComputer programming 606 $aComputer networks 606 $aComputer science 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aProgramming Techniques 606 $aComputer Communication Networks 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aComputer programming. 615 0$aComputer networks. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 14$aProgramming Techniques. 615 24$aComputer Communication Networks. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a005.1 701 $aSerna$b Maria$f1959-$01221274 712 12$aInternational Workshop on Randomization and Computation$d(14th :$f2010 :$eBarcelona, Spain) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484749503321 996 $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$94521772 997 $aUNINA