top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Theory and Applications of Models of Computation [[electronic resource] ] : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
Theory and Applications of Models of Computation [[electronic resource] ] : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XIV, 423 p. 75 illus.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Computer science—Mathematics
Algorithms
Data structures (Computer science)
Information theory
Machine theory
Theory of Computation
Mathematics of Computing
Computer Science Logic and Foundations of Programming
Data Structures and Information Theory
Formal Languages and Automata Theory
ISBN 3-319-06089-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Roadmap for TAMC -- A tight lower bound instance for k-means++ in constant dimension -- An improved Upper-bound for Rivest et al.’s Half-lie Problem -- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update -- Finite State Incompressible Infinite Sequences -- Finding optimal strategies of almost acyclic Simple Stochastic Games -- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes -- On representations of abstract systems with partial inputs and outputs -- Complexity Information Flow in a Multi-threaded Imperative Language -- An Incremental Algorithm for Computing Prime Implicates in Modal Logic -- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems -- space complexity of optimization problems in planar graphs -- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching -- Intersection Dimension of Bipartite Graphs -- On the Parameterized Complexity for Token Jumping on Graphs -- More on Universality of Spiking Neural P Systems with Anti-Spikes -- Modular Form Approach to Solving Lattice Problems.
Record Nr. UNISA-996203623703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Theory and Applications of Models of Computation : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
Theory and Applications of Models of Computation : 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings / / edited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XIV, 423 p. 75 illus.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Computer science—Mathematics
Algorithms
Data structures (Computer science)
Information theory
Machine theory
Theory of Computation
Mathematics of Computing
Computer Science Logic and Foundations of Programming
Data Structures and Information Theory
Formal Languages and Automata Theory
ISBN 3-319-06089-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Roadmap for TAMC -- A tight lower bound instance for k-means++ in constant dimension -- An improved Upper-bound for Rivest et al.’s Half-lie Problem -- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update -- Finite State Incompressible Infinite Sequences -- Finding optimal strategies of almost acyclic Simple Stochastic Games -- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes -- On representations of abstract systems with partial inputs and outputs -- Complexity Information Flow in a Multi-threaded Imperative Language -- An Incremental Algorithm for Computing Prime Implicates in Modal Logic -- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems -- space complexity of optimization problems in planar graphs -- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching -- Intersection Dimension of Bipartite Graphs -- On the Parameterized Complexity for Token Jumping on Graphs -- More on Universality of Spiking Neural P Systems with Anti-Spikes -- Modular Form Approach to Solving Lattice Problems.
Record Nr. UNINA-9910483672403321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui