Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Knowledge Spillovers in Regional Innovation Systems : A Case Study of CEE Regions / / edited by Jan Stejskal, Petr Hajek, Oto Hudec
| Knowledge Spillovers in Regional Innovation Systems : A Case Study of CEE Regions / / edited by Jan Stejskal, Petr Hajek, Oto Hudec |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (294 pages) |
| Disciplina | 307.120943 |
| Collana | Advances in Spatial Science, The Regional Science Series |
| Soggetto topico |
Regional economics
Spatial economics European Economic Community literature Economic policy Industrial organization Regional/Spatial Science European Integration R & D/Technology Policy Industrial Organization |
| ISBN | 3-319-67029-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I: Overview -- Part II: Evaluation and Assessment of Regional Innovation Systems -- Part III: The Evolution and Dynamics of Regional Innovation Systems -- Part IV: The Economic and Social Impact of Knowledge Spillovers in Regional Innovation Systems. |
| Record Nr. | UNINA-9910299656403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Foundations of Computer Science 1995 [[electronic resource] ] : 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings / / edited by Jiri Wiedermann, Petr Hajek
| Mathematical Foundations of Computer Science 1995 [[electronic resource] ] : 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings / / edited by Jiri Wiedermann, Petr Hajek |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XIII, 594 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Programming languages (Electronic computers) Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-44768-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Scheduling parallel communication: The h-relation problem -- Decomposable structures, Boolean function representations, and optimization -- The complexity of interval routing on random graphs -- Bridging across the log(n) space frontier -- Second order logic and the weak exponential hierarchies -- On the computing paradigm and computational complexity -- Ranked structures in nonmonotonic reasoning and belief revision: Abstract -- Symbolic dynamics and finite automata -- Lower bounds for propositional proofs and independence results in bounded arithmetic (abstract) -- Physics and the new computation -- Measure on P: Robustness of the notion -- Comparing counting classes for logspace, one-way logspace, and first-order -- Automata that take advice -- Nonuniform lower bounds for exponential time classes -- On a quantitative notion of uniformity -- Separations by random oracles and “Almost” classes for generalized reducibilities -- On the complexity of finite memory policies for Markov decision processes -- Derandomization for sparse approximations and independent sets -- Asymptotically efficient in-place merging -- The complexity of the falsifiability problem for pure implicational formulas -- Strong lower bounds on the approximability of some NPO PB-complete maximization problems -- Some typical properties of large AND/OR Boolean formulas -- The hedge: An efficient storage device for Turing machines with one head -- Graph inference from a walk for trees of bounded degree 3 is NP-complete -- Honeycomb networks -- Witness-isomorphic reductions and the local search problem (extended abstract) -- Multiple product modulo arbitrary numbers -- Lower bounds for the majority communication complexity of various graph accessibility problems -- Strong optimal lower bounds for Turing machines that accept nonregular languages -- A superpolynomial lower bound for (1,+k(n))-branching programs -- Deterministic parsing for augmented context-free grammars -- A periodicity theorem on words and applications -- A new approach to analyse Coupled-Context-Free languages -- Computational complexity of simultaneous elementary matching problems -- Graph reducibility of term rewriting systems -- Positive recursive type assignment -- String recognition on anonymous rings -- The firing squad synchronization problem on Cayley graphs -- Solving cheap graph problems on Meshes -- An elementary bisimulation decision procedure for arbitrary context-free processes -- On congruences and partial orders -- Performance preorder: Ordering processes with respect to speed -- Towards a semantic theory of CML -- Modular constructions of distributing automata -- On the proof method for bisimulation -- Towards a calculus of predicate transformers -- An abstract account of composition -- Syntax and semantics of Procol -- Synthesizing distinguishing formulae for real time systems -extended abstract -- From timed automata to logic — and back -- Incremental model checking for decomposable structures -- Automata for the modal ?-calculus and related results -- A ?-calculus with local views for systems of sequential agents -- An operator calculus approach to the evolution of dynamic data structures. |
| Record Nr. | UNISA-996466154403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||