LEADER 01134nam a2200289 i 4500 001 991000439959707536 005 20020503180732.0 008 990114s1988 it ita 020 $a8823800013 035 $ab10077789-39ule_inst 035 $aLE02516145$9ExL 040 $aFac. Economia$bita 082 0 $a338.884 100 1 $aRenoldi, Angelo$089029 245 13$aLa competitività nell'oligopolio internazionale /$cAngelo Renoldi 260 $aMilano :$bEGEA,$cc1988 300 $ax, 153 p. ;$c23 cm 490 0 $aScritti ;$v1 500 $aIn appendice: L'influenza del cambio sulla competitività dei settori industriali italiani nell'oligopolio internazionale: rilevazioni empiriche 650 4$aCommercio internazionale$xPrezzi 650 4$aOligopoli 907 $a.b10077789$b24-09-18$c27-06-02 912 $a991000439959707536 945 $aLE025 ECO 338.8 REN01.01$g1$i2025000052208$lle025$nCatalogato 2018$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i10088507$z27-06-02 996 $aCompetitività nell'oligopolio internazionale$9195486 997 $aUNISALENTO 998 $ale025$b01-01-99$cm$da $e-$fita$git $h3$i1 LEADER 06868nam 22008175 450 001 9910483705003321 005 20251226195731.0 010 $a3-540-69407-2 024 7 $a10.1007/978-3-540-69407-6 035 $a(CKB)1000000000440796 035 $a(SSID)ssj0000318692 035 $a(PQKBManifestationID)11279923 035 $a(PQKBTitleCode)TC0000318692 035 $a(PQKBWorkID)10311272 035 $a(PQKB)11542858 035 $a(DE-He213)978-3-540-69407-6 035 $a(MiAaPQ)EBC3068527 035 $a(PPN)127051791 035 $a(EXLCZ)991000000000440796 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic and Theory of Algorithms $e4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15-20, 2008, Proceedings /$fedited by Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIX, 596 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5028 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-69405-6 320 $aIncludes bibliographical references and index. 327 $aDeterministic Graphical Games Revisited -- Program Schemes with Deep Pushdown Storage -- Herbrand Theorems and Skolemization for Prenex Fuzzy Logics -- Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL -- Pure Iteration and Periodicity -- Programming Experimental Procedures for Newtonian Kinematic Machines -- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time -- A Summation Algorithm from 11th Century China -- Sequential Automatic Algebras -- The Role of Classical Computation in Measurement-Based Quantum Computation -- The Algebraic Counterpart of the Wagner Hierarchy -- Computing by Observing: A Brief Survey -- A Quantum Information-Theoretic Proof of the Relation between Horn?s Problem and the Littlewood-Richardson Coefficients -- Pell Equations and Weak Regularity Principles -- Computable Categoricity of Graphs with Finite Components -- P Automata: Membrane Systems as Acceptors -- On the Processing Power of Protozoa -- Computing Equilibria in Large Games We Play -- A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC -- Phase Transitions for Weakly Increasing Sequences -- Succinct NP Proofs from an Extractability Assumption -- Describing the Wadge Hierarchy for the Alternation Free Fragment of ?-Calculus (I) -- Subrecursive Complexity of Identifying the Ramsey Structure of Posets -- Solving Simple Stochastic Games -- The Shrinking Property for NP and coNP -- On the Hardness of Truthful Online Auctions with Multidimensional Constraints -- Effective Dimensions and Relative Frequencies -- Reachability in Linear Dynamical Systems -- Hybrid Functional Interpretations -- The Algorithm Concept ? Tool for Historiographic Interpretation or Red Herring? -- Adversarial Scheduling Analysis of Game-TheoreticModels of Norm Diffusion -- A Simple P-Matrix Linear Complementarity Problem for Discounted Games -- Implementing Spi Calculus Using Nominal Techniques -- An Enhanced Theory of Infinite Time Register Machines -- Many Facets of Complexity in Logic -- On the Computational Power of Enhanced Mobile Membranes -- Recursion in Higher Types and Resource Bounded Turing Machines -- Computability and Complexity in Self-assembly -- Extraction in Coq: An Overview -- Joining to High Degrees -- Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem -- Interpreting Localized Computational Effects Using Operators of Higher Type -- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants -- Updatable Timed Automata with Additive and Diagonal Constraints -- First-Order Model Checking Problems Parameterized by the Model -- Domain Theory and the Causal Structure of Space-Time -- Recursion on Nested Datatypes in Dependent Type Theory -- Perfect Local Computability and Computable Simulations -- Complete Determinacy and Subsystems of Second Order Arithmetic -- Internal Density Theorems for Hierarchies of Continuous Functionals -- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem -- The Relative Consistency of the Axiom of Choice ? Mechanized Using Isabelle/ZF -- Upper Semilattices in Many-One Degrees -- Union of Reducibility Candidates for Orthogonal Constructor Rewriting -- The Quantum Complexity of Markov Chain Monte Carlo -- Topological Dynamics of 2D Cellular Automata -- Complexity of Aperiodicity for Topological Properties of Regular ?-Languages -- ?-Degree Spectra -- Cupping Classes of Enumeration Degrees -- Principal Typings for Explicit Substitutions Calculi -- How We Think of Computing Today. 330 $aThis book constitutes the refereed proceedings of the 4th International Conference on Computability in Europe, CiE 2008, held in Athens, Greece, in June 2008. The 36 revised full papers presented together with 25 invited tutorials and lectures were carefully reviewed and selected from 108 submissions. Among them are papers of 6 special sessions entitled algorithms in the history of mathematics, formalising mathematics and extracting algorithms from proofs, higher-type recursion and applications, algorithmic game theory, quantum algorithms and complexity, and biology and computation. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5028 606 $aSoftware engineering 606 $aLife sciences 606 $aComputer programming 606 $aComputer science 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aSoftware Engineering 606 $aLife Sciences 606 $aProgramming Techniques 606 $aTheory of Computation 606 $aAlgorithms 606 $aMathematics of Computing 615 0$aSoftware engineering. 615 0$aLife sciences. 615 0$aComputer programming. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 14$aSoftware Engineering. 615 24$aLife Sciences. 615 24$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aMathematics of Computing. 676 $a005.1 701 $aBeckmann$b Arnold$01752879 701 $aDimitracopoulos$b Costas$01756075 701 $aLowe$b Benedikt$0915589 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483705003321 996 $aLogic and theory of algorithms$94193170 997 $aUNINA