LEADER 03551nam1 22007333i 450 001 MOD0228919 005 20251003044239.0 020 $aIT$b781498 100 $a20231114d1976 ||||0itac50 ba 101 | $aita$ceng 102 $ait 105 $a|||| |||c| 181 1$6z01$ai $bxxxe 182 1$6z01$an 183 1$6z01$anc$2RDAcarrier 200 1 $aCongetture e confutazioni$elo sviluppo della conoscenza scientifica$fKarl R. Popper 210 $aBologna$cIl Mulino 215 $av.$d19 225 | $aUniversale paperbacks Il mulino$v50 300 $aTraduzione di Giuliano Pancaldi. 410 0$1001CFI0000033$12001 $aUniversale paperbacks Il mulino$v50 463 1$1001PUV0256244$12000 $a2$fKarl R. Popper 463 1$1001TO01445206$12000 $aVol. 1$fKarl R. Popper$v1 463 1$1001TO01445214$12000 $aVol. 2$fKarl R. Popper$v2 500 10$aConjectures and refutations.$3CFI0166016$9CFIV030536$913190 606 $aEpistemologia$2FIR$3CFIC002140$9E 606 $aGnoseologia$2FIR$3CFIC010338$9E 676 $a121$9Gnoseologia (teoria della conoscenza)$v14 676 $a121$9GNOSEOLOGIA. (TEORIA DELLA CONOSCENZA)$v21 676 $a121$9Gnoseologia$v22 676 $a193$9FILOSOFIA OCCIDENTALE MODERNA. GERMANIA E AUSTRIA$v12 676 $a193$9Filosofia occidentale moderna. Germania e Austria$v14 676 $a193$9FILOSOFIA OCCIDENTALE MODERNA. GERMANIA E AUSTRIA$v21 676 $a500$9SCIENZE NATURALI E MATEMATICA$v21 676 $a501$9SCIENZE PURE. FILOSOFIA E TEORIA$v12 676 $a501$9Scienze naturali e matematica. Filosofia e teoria$v14 676 $a501$9SCIENZE PURE. FILOSOFIA E TEORIA$v19 676 $a501$9SCIENZE PURE. FILOSOFIA E TEORIA$v20 676 $a501$9SCIENZE NATURALI E MATEMATICA. FILOSOFIA E TEORIA$v21 676 $a501$9SCIENZE NATURALI E MATEMATICA. FILOSOFIA E TEORIA$v23 696 $aFilosofia della scienza 696 $aTeoria della conoscenza 699 $aEpistemologia$zFilosofia della scienza 699 $aGnoseologia$yTeoria della conoscenza 700 1$aPopper$b, Karl R.$3CFIV030536$4070$0159114 790 1$aPopper$b, Karl$3CFIV160493$zPopper, Karl R. 790 1$aPopper$b, Karl Raimund$3CFIV185853$zPopper, Karl R. 801 3$aIT$bIT-000000$c20231114 850 $aIT-BN0095 $aIT-NA0603 $aIT-BN0083 $aIT-SA0252 $aIT-NA0074 $aIT-NA0079 $aIT-NA0120 $aIT-NA0700 $aIT-AV0045 $aIT-BN0015 $aIT-NA0249 901 $bNAP MV$cD $nDEPOSITO LIBRARIO NARRATIVA SALA D 901 $bNAP 01$cSALA DING $n$ 901 $bNAP 09$cS. LETTURA$n$ 901 $bNAP BN$cMAGAZZINO $nmagazzini correnti divisi per anni 901 $bNAP 83$cIAN $n$ 901 $bNAP LA$cBIBLIOTECA$n$ 901 $bNAP 91$cSC $nLa sezione include documenti di scienze pure ed applicate 901 $bNAP SG$cSALA E $n$ 901 $bNAP CR$cCORSI $n$ 901 $bNAP 32$cFILOSOFIA $n$ 912 $aMOD0228919 950 1$aBiblioteca Centralizzata di Ateneo$c1 v. in due copie$d 01SALA DING 121 POP.co$e 0102 0000011165 VMA A4(bis 1 v. (2. copia)$fY $h19940614$i19940614$c1 v. in due copie$d 01SALA DING 121 POP.co$e 0102 0000002365 VMA A4 1 v.$fY $h19930602$i19930602 977 $a 01$a 09$a 32$a 83$a 91$a BN$a CR$a LA$a MV$a PB$a SG 996 $aConjectures and refutations$913190 997 $aUNISANNIO LEADER 06908nam 22008055 450 001 9910484349103321 005 20251226195200.0 010 $a3-642-40328-X 024 7 $a10.1007/978-3-642-40328-6 035 $a(CKB)3710000000015913 035 $a(SSID)ssj0000988036 035 $a(PQKBManifestationID)11619327 035 $a(PQKBTitleCode)TC0000988036 035 $a(PQKBWorkID)10950915 035 $a(PQKB)11324163 035 $a(DE-He213)978-3-642-40328-6 035 $a(MiAaPQ)EBC3093443 035 $a(PPN)172429323 035 $a(EXLCZ)993710000000015913 100 $a20130816d2013 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques $e16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings /$fedited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XIV, 716 p. 48 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8096 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-40327-1 327 $aSpectral Sparsification in Dynamic Graph Streams -- The Online Stochastic Generalized Assignment Problem -- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems -- Approximating Large Frequency Moments with Pick-and-Drop Sampling -- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams -- Capacitated Network Design on Undirected Graphs -- Scheduling Subset Tests: One-Time, Continuous, and How They Relate -- On the Total Perimeter of Homothetic Convex Bodies in a Convex Container -- Partial Interval Set Cover ? Trade-Offs between Scalability and Optimality -- Online Square-into-Square Packing -- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions -- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems -- Multiple Traveling Salesmen in Asymmetric Metrics -- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback -- The Approximability of the Binary Paintshop Problem -- Approximation Algorithms for Movement Repairmen -- Improved Hardness of Approximating Chromatic Number -- A Pseudo-approximation for the Genus of Hamiltonian Graphs -- A Local Computation Approximation Scheme to Maximum Matching -- Sketching Earth-Mover Distance on Graph Metrics -- Online Multidimensional Load Balancing -- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs -- Interdiction Problems on Planar Graphs -- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration -- Finding Heavy Hitters from Lossy or Noisy Data -- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy -- Phase Coexistence and Slow Mixing for the Hard-Core Model on Z2 -- Fast Private Data Release Algorithms for Sparse Queries -- Local Reconstructors and Tolerant Testers for Connectivity and Diameter -- An Optimal Lower Bound for Monotonicity Testing over Hypergrids -- Small-Bias Sets for NonabelianGroups: Derandomizations of the Alon-Roichman Theorem -- What You Can Do with Coordinated Samples -- Robust Randomness Amplifiers: Upper and Lower Bounds -- The Power of Choice for Random Satisfiability -- Connectivity of Random High Dimensional Geometric Graphs -- Matching-Vector Families and LDCs over Large Modulo -- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing -- Testing Membership in Counter Automaton Languages -- Tight Lower Bounds for Testing Linear Isomorphism -- Randomness-Efficient Curve Samplers -- Combinatorial Limitations of Average-Radius List Decoding -- Zero Knowledge LTCs and Their Applications -- A Tight Lower Bound for High Frequency Moment Estimation with Small Error -- Improved FPTAS for Multi-spin Systems -- Pseudorandomness for Regular Branching Programs via Fourier Analysis -- Absolutely Sound Testing of Lifted Codes -- On the Average Sensitivity and Density of k-CNF Formulas -- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. 330 $aThis book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8096 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aNumerical analysis 606 $aMathematical statistics 606 $aArtificial intelligence$xData processing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 606 $aNumerical Analysis 606 $aProbability and Statistics in Computer Science 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aNumerical analysis. 615 0$aMathematical statistics. 615 0$aArtificial intelligence$xData processing. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 615 24$aNumerical Analysis. 615 24$aProbability and Statistics in Computer Science. 615 24$aData Science. 676 $a005.1 702 $aRaghavendra$b Prasad$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRaskhodnikova$b Sofya$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRolim$b José D.P$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910484349103321 996 $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$9772207 997 $aUNINA