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.
Combinatorial Algorithms [[electronic resource] ] : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers / / edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth
| Combinatorial Algorithms [[electronic resource] ] : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers / / edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XII, 434 p. 80 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Artificial intelligence Numerical analysis Data protection Discrete Mathematics in Computer Science Data Science Artificial Intelligence Numerical Analysis Data and Information Security |
| ISBN | 3-319-78825-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximation algorithms and hardness -- Computational complexity -- Computational geometry -- Graphs and combinatorics -- Graph colourings, labellings and power domination -- Heuristics -- Mixed integer programming -- Polynomial algorithms -- Privacy -- String algorithms. |
| Record Nr. | UNISA-996466233903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers / / edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth
| Combinatorial Algorithms [[electronic resource] ] : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers / / edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XII, 434 p. 80 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Artificial intelligence Numerical analysis Data protection Discrete Mathematics in Computer Science Data Science Artificial Intelligence Numerical Analysis Data and Information Security |
| ISBN | 3-319-78825-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximation algorithms and hardness -- Computational complexity -- Computational geometry -- Graphs and combinatorics -- Graph colourings, labellings and power domination -- Heuristics -- Mixed integer programming -- Polynomial algorithms -- Privacy -- String algorithms. |
| Record Nr. | UNINA-9910349424203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung
| Combinatorial Algorithms [[electronic resource] ] : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIX, 388 p. 78 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Data protection Software engineering Image processing—Digital techniques Computer vision Data structures (Computer science) Information theory Discrete Mathematics in Computer Science Data and Information Security Software Engineering Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory |
| ISBN | 3-319-94667-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Some Recent New Directions in Multivariate Algorithmics -- Survey of some recent near polynomial time results for Parity Games -- Range Minimum Queries and Applications -- Collision-free Routing Problem with Restricted L-path -- Linear clique-width of bi-complement reducible graphs -- Linear Ramsey numbers -- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families -- Minimum Polygons for Fixed Visibility VC-Dimension -- Minsum k-Sink Problem on Dynamic Flow Path Networks -- Fully leafed induced subtrees -- Pattern matching for k--track permutations -- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs -- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs -- Covering with Clubs: Complexity and Approximability -- On the Expected Number of Distinct Gapped Palindromic Factors -- Computational Complexity of Robot Arm Simulation Problems -- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation -- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth -- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem -- Structural Parameterizations for Colorful Components -- Analysis of Information Leakage due to Operative Errors in Card-based Protocols -- Zero-Suppression and Computation Models -- The Crossing Number of Seq-Shellable Drawings of Complete Graphs -- Cryptographic limitations on polynomial-time a posteriori query learning -- Placing Segments On Parallel Arcs -- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem -- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression -- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation -- Separating Interaction Effects Using Locating and Detecting Arrays -- An Efficient Representation of Partitions of Integers -- How far from a worst solution a random solution of a k-CSP instance can be?. |
| Record Nr. | UNINA-9910349427403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings / / edited by Veli Mäkinen, Simon J. Puglisi, Leena Salmela
| Combinatorial Algorithms [[electronic resource] ] : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings / / edited by Veli Mäkinen, Simon J. Puglisi, Leena Salmela |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XX, 462 p. 100 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Artificial intelligence Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Data Science Artificial Intelligence |
| ISBN | 3-319-44543-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computational complexity -- On the complexity of computing the tree-breadth.-Online Chromatic Number is PSPACE-Complete -- Computational geometry -- Bounded embeddings of graphs in the plane -- Crushing Disks Efficiently.-Essential Constraints of Edge-Constrained Proximity Graphs -- Plane Bichromatic Trees of Low Degree -- Networks -- Directing Road Networks by Listing Strong Orientations -- Evangelism in Social Networks -- Distance Queries in Large-Scale Fully Dynamic Complex Networks -- Minimax Regret 1-Median Problem in Dynamic Path Networks -- Enumeration -- On Maximal Chain Subgraphs and Covers of Bipartite Graphs -- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations -- Reconfiguration of Steiner Trees in an Unweighted Graph -- Online algorithms -- Weighted Online Problems with Advice -- Finding gapped palindromes online -- Advice Complexity of the Online Search Problem -- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing -- Algorithmic graph theory -- A boundary property for upper domination -- Upper Domination: Complexity and Approximation -- Well-quasi-ordering versus clique-width: new results on bigenic classes -- Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles -- Dynamic programming -- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees -- Speeding up dynamic programming in the line-constrained k-median -- Combinatorial algorithms -- SOBRA - Shielding Optimization for BRAchytherapy -- A bit-scaling algorithm for integer feasibility in UTVPI constraints -- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem -- Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs -- Graph algorithms -- Finding Cactus Roots in Polynomial Time -- Computing Giant Graph Diameters -- Faster Computation of Path-Width -- The Solution Space of Sorting with Recurring Comparison Faults -- Combinatorics -- Monotone paths in geometric triangulations -- On computing the total displacement number via weighted Motzkin paths -- Probabilistics -- Partial Covering Arrays: Algorithms and Asymptotics -- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently. |
| Record Nr. | UNISA-996465654503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings / / edited by Veli Mäkinen, Simon J. Puglisi, Leena Salmela
| Combinatorial Algorithms [[electronic resource] ] : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings / / edited by Veli Mäkinen, Simon J. Puglisi, Leena Salmela |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XX, 462 p. 100 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Artificial intelligence Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Data Science Artificial Intelligence |
| ISBN | 3-319-44543-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computational complexity -- On the complexity of computing the tree-breadth.-Online Chromatic Number is PSPACE-Complete -- Computational geometry -- Bounded embeddings of graphs in the plane -- Crushing Disks Efficiently.-Essential Constraints of Edge-Constrained Proximity Graphs -- Plane Bichromatic Trees of Low Degree -- Networks -- Directing Road Networks by Listing Strong Orientations -- Evangelism in Social Networks -- Distance Queries in Large-Scale Fully Dynamic Complex Networks -- Minimax Regret 1-Median Problem in Dynamic Path Networks -- Enumeration -- On Maximal Chain Subgraphs and Covers of Bipartite Graphs -- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations -- Reconfiguration of Steiner Trees in an Unweighted Graph -- Online algorithms -- Weighted Online Problems with Advice -- Finding gapped palindromes online -- Advice Complexity of the Online Search Problem -- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing -- Algorithmic graph theory -- A boundary property for upper domination -- Upper Domination: Complexity and Approximation -- Well-quasi-ordering versus clique-width: new results on bigenic classes -- Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles -- Dynamic programming -- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees -- Speeding up dynamic programming in the line-constrained k-median -- Combinatorial algorithms -- SOBRA - Shielding Optimization for BRAchytherapy -- A bit-scaling algorithm for integer feasibility in UTVPI constraints -- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem -- Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs -- Graph algorithms -- Finding Cactus Roots in Polynomial Time -- Computing Giant Graph Diameters -- Faster Computation of Path-Width -- The Solution Space of Sorting with Recurring Comparison Faults -- Combinatorics -- Monotone paths in geometric triangulations -- On computing the total displacement number via weighted Motzkin paths -- Probabilistics -- Partial Covering Arrays: Algorithms and Asymptotics -- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently. |
| Record Nr. | UNINA-9910484536503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / / edited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek
| Combinatorial Algorithms [[electronic resource] ] : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / / edited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIII, 377 p. 70 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Bioinformatics Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Data Science Computational and Systems Biology |
| ISBN | 3-319-19315-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism -- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem -- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk -- On the Galois Lattice of Bipartite Distance Hereditary Graphs -- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance -- Border Correlations, Lattices and the Subgraph Component Polynomial -- Computing Minimum Length Representations of Sets of Words of Uniform Length -- Computing Primitively-Rooted Squares and Runs in Partial Words -- 3-coloring triangle-free planar graphs with a precolored 9-cycle -- Computing Heat Kernel Pagerank and a Local Clustering Algorithm -- Solving Matching Problems Efficiently in Bipartite Graphs -- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras -- On decomposing the complete graph into the union of two disjoint cycles -- Reconfiguration of Vertex Covers in a Graph -- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory -- On Maximum Common Subgraph Problems in Series-Parallel Graphs -- Profile-based optimal matchings in the Student/Project Allocation Problem -- The Min-Max Edge q-Coloring Problem -- Speeding up Graph Algorithms via Switching Classes -- Metric Dimension for Amalgamations of Graphs -- Deterministic Algorithms for the Independent Feedback Vertex Set Problem -- Lossless seeds for searching short patterns with high error rates. |
| Record Nr. | UNISA-996198526003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / / edited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek
| Combinatorial Algorithms [[electronic resource] ] : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / / edited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIII, 377 p. 70 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Bioinformatics Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Data Science Computational and Systems Biology |
| ISBN | 3-319-19315-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism -- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem -- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk -- On the Galois Lattice of Bipartite Distance Hereditary Graphs -- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance -- Border Correlations, Lattices and the Subgraph Component Polynomial -- Computing Minimum Length Representations of Sets of Words of Uniform Length -- Computing Primitively-Rooted Squares and Runs in Partial Words -- 3-coloring triangle-free planar graphs with a precolored 9-cycle -- Computing Heat Kernel Pagerank and a Local Clustering Algorithm -- Solving Matching Problems Efficiently in Bipartite Graphs -- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras -- On decomposing the complete graph into the union of two disjoint cycles -- Reconfiguration of Vertex Covers in a Graph -- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory -- On Maximum Common Subgraph Problems in Series-Parallel Graphs -- Profile-based optimal matchings in the Student/Project Allocation Problem -- The Min-Max Edge q-Coloring Problem -- Speeding up Graph Algorithms via Switching Classes -- Metric Dimension for Amalgamations of Graphs -- Deterministic Algorithms for the Independent Feedback Vertex Set Problem -- Lossless seeds for searching short patterns with high error rates. |
| Record Nr. | UNINA-9910483048203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / / edited by Thierry Lecroq, Laurent Mouchard
| Combinatorial Algorithms [[electronic resource] ] : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / / edited by Thierry Lecroq, Laurent Mouchard |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXII, 474 p. 135 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Data Science Symbolic and Algebraic Manipulation |
| ISBN | 3-642-45278-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms on graphs -- Algorithms on strings -- Discrete geometry -- Satisfiability. |
| Record Nr. | UNISA-996465340603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / / edited by Thierry Lecroq, Laurent Mouchard
| Combinatorial Algorithms [[electronic resource] ] : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / / edited by Thierry Lecroq, Laurent Mouchard |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXII, 474 p. 135 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Data Science Symbolic and Algebraic Manipulation |
| ISBN | 3-642-45278-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms on graphs -- Algorithms on strings -- Discrete geometry -- Satisfiability. |
| Record Nr. | UNINA-9910484440603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers / / edited by Costas S. Iliopoulos, William F. Smyth
| Combinatorial Algorithms [[electronic resource] ] : 22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers / / edited by Costas S. Iliopoulos, William F. Smyth |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XI, 387 p.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Discrete Mathematics in Computer Science Formal Languages and Automata Theory Data Science Symbolic and Algebraic Manipulation |
| ISBN | 3-642-25011-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465937903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
