LEADER 02374nam a2200409 i 4500 001 991000934239707536 005 20020507104045.0 008 951206s1967 it ||| | ita 035 $ab10150195-39ule_inst 035 $aLE00639357$9ExL 040 $aDip.to Fisica$bita 084 $a53(022) 084 $a53.0.6 084 $a53.0.42 100 1 $aPlantamura, Vito Leonardo$0308319 245 10$aEsperimentazioni di fisica :$bcon elementi della teoria sugli errori /$cVito Leonardo Plantamura, Rocco Solida 260 $aBari :$bAdriatica Editrice Salentina,$c1967 300 $axxv, 295 p. :$bill. ;$c25 cm. 650 4$aFisica sperimentale-Esperimenti 700 1 $aSolida, Rocco$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0733157 710 2 $aUniversità degli Studi, Bari. Istituto di Fisica 907 $a.b10150195$b02-04-14$c27-06-02 912 $a991000934239707536 945 $aLE006 53(022)+53.0.6 PLA$g1$i2006000003773$lle006$o-$pE0.00$q-$rn$so $t0$u5$v0$w5$x0$y.i1017977x$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$i2006000171113$lle006$o-$pE0.00$q-$rl$s- $t0$u23$v0$w23$x0$y.i10179781$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$i2006000156110$lle006$o-$pE0.00$q-$rl$s- $t0$u21$v0$w21$x0$y.i10179793$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$i2006000083430$lle006$o-$pE0.00$q-$rl$s- $t0$u23$v0$w23$x0$y.i1017980x$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$iLE006-871$lle006$on$pE0.00$q-$rl$sm $t0$u0$v0$w0$x0$y.i10179811$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$i2006000095600$lle006$o-$pE0.00$q-$rl$s- $t0$u20$v0$w20$x0$y.i10179823$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$lle006$o-$pE0.00$q-$rl$s- $t0$u22$v0$w22$x0$y.i10179835$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$i2006000095587$lle006$o-$pE0.00$q-$rl$s- $t0$u28$v2$w28$x0$y.i10179847$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$iLE006-3715$lle006$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i10179859$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$i2006000097048$lle006$o-$pE0.00$q-$rl$s- $t0$u24$v0$w24$x0$y.i10179860$z27-06-02 945 $aLE006 53(022)+53.0.6 PLA$g1$iLE006-3717$lle006$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i10179872$z27-06-02 996 $aEsperimentazioni di fisica$91444808 997 $aUNISALENTO 998 $ale006$b01-01-95$cm$da $e-$fita$git $h0$i11 LEADER 06504nam 22008175 450 001 9910144029003321 005 20251116234356.0 010 $a3-540-45077-7 024 7 $a10.1007/b11926 035 $a(CKB)1000000000212107 035 $a(SSID)ssj0000323379 035 $a(PQKBManifestationID)11250812 035 $a(PQKBTitleCode)TC0000323379 035 $a(PQKBWorkID)10299953 035 $a(PQKB)11790607 035 $a(DE-He213)978-3-540-45077-1 035 $a(MiAaPQ)EBC3088330 035 $a(PPN)155224271 035 $a(BIP)13638274 035 $a(BIP)8796269 035 $a(EXLCZ)991000000000212107 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFundamentals of Computation Theory $e14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings /$fedited by Andrzej Lingas, Bengt J. Nilsson 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (CDLII, 440 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2751 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-40543-7 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aApproximability 1 -- Proving Integrality Gaps without Knowing the Linear Program -- An Improved Analysis of Goemans and Williamson?s LP-Relaxation for MAX SAT -- Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques -- Approximability 2 -- Inapproximability Results for Bounded Variants of Optimization Problems -- Approximating the Pareto Curve with Local Search for the Bicriteria TSP(1,2) Problem -- Scheduling to Minimize Max Flow Time: Offline and Online Algorithms -- Algorithms 1 -- Linear Time Algorithms for Some NP-Complete Problems on (P 5,Gem)-Free Graphs -- Graph Searching, Elimination Trees, and a Generalization of Bandwidth -- Constructing Sparse t-Spanners with Small Separators -- Composing Equipotent Teams -- Algorithms 2 -- Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers -- An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates -- Periodic Multisorting Comparator Networks -- Fast Periodic Correction Networks -- Networks and Complexity -- Games and Networks -- One-Way Communication Complexity of Symmetric Boolean Functions -- Circuits on Cylinders -- Computational Biology -- Fast Perfect Phylogeny Haplotype Inference -- On Exact and Approximation Algorithms for Distinguishing Substring Selection -- Complexity of Approximating Closest Substring Problems -- Computational Geometry -- On Lawson?s Oriented Walk in Random Delaunay Triangulations -- Competitive Exploration of Rectilinear Polygons -- An Improved Approximation Algorithm for Computing Geometric Shortest Paths -- Adaptive and Compact Discretization for Weighted Region Optimal Path Finding -- On Boundaries of Highly Visible Spaces and Applications -- Computational Models and Complexity -- Membrane Computing -- Classical Simulation Complexity of Quantum Machines -- Using Depth to Capture Average-Case Complexity -- Structural Complexity -- Non-uniform Depth of Polynomial Time and Space Simulations -- Dimension- and Time-Hierarchies for Small Time Bounds -- Baire?s Categories on Small Complexity Classes -- Formal Languages -- Operations Preserving Recognizable Languages -- Languages Defined by Generalized Equality Sets -- Context-Sensitive Equivalences for Non-interference Based Protocol Analysis -- On the Exponentiation of Languages -- Kleene?s Theorem for Weighted Tree-Automata -- Logic -- Weak Cardinality Theorems for First-Order Logic -- Compositionality of Hennessy-Milner Logic through Structural Operational Semantics -- On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. 330 $aThis book constitutes the refereed proceedings of the 14th International Symposium Fundamentals of Computation Theory, FCT 2003, held in Malmo?, Sweden in August 2003.The 36 revised full papers presented together with an invited paper and the abstracts of 2 invited talks were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on approximibility, algorithms, networks and complexity, computational biology, computational geometry, computational models and complexity, structural complexity, formal languages, and logic. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2751 606 $aComputers 606 $aAlgorithms 606 $aLogic, Symbolic and mathematical 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aAlgorithms. 615 0$aLogic, Symbolic and mathematical. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aMathematical Logic and Formal Languages. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a004 702 $aLingas$b Andrzej$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNilsson$b Bengt J$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFCT 2003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144029003321 996 $aFundamentals of Computation Theory$92557870 997 $aUNINA