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.
Algorithmic Learning Theory [[electronic resource] ] : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
| Algorithmic Learning Theory [[electronic resource] ] : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 397 p. 30 illus.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Computers Computer logic Pattern recognition Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
| ISBN | 3-642-40935-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Learning and Optimizing with Preferences -- Efficient Algorithms for Combinatorial Online Prediction -- Exact Learning from Membership Queries: Some Techniques, Results and New Directions -- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration -- Combinatorial Online Prediction via Metarounding -- On Competitive Recommendations -- Online PCA with Optimal Regrets -- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages -- Topological Separations in Inductive Inference -- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data -- Universal Knowledge-Seeking Agents for Stochastic Environments -- Teaching and Learning from Queries Order Compression Schemes -- Learning a Bounded-Degree Tree Using Separator Queries -- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates -- Robust Risk-Averse Stochastic Multi-armed Bandits -- An Efficient Algorithm for Learning with Semi-bandit Feedback -- Differentially-Private Learning of Low Dimensional Manifolds -- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data -- Adaptive Metric Dimensionality Reduction -- Dimension-Adaptive Bounds on Compressive FLD Classification -- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study -- Concentration and Confidence for Discrete Bayesian Sequence Predictors -- Algorithmic Connections between Active Learning and Stochastic Convex Optimization -- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning -- Fast Spectral Clustering via the Nyström Method -- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. |
| Record Nr. | UNISA-996465423903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings / / edited by Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita
| Algorithmic Learning Theory [[electronic resource] ] : 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings / / edited by Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 491 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Mathematical logic Natural language processing (Computer science) Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN |
3-540-31696-5
3-540-29242-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Invention and Artificial Intelligence -- The Arrowsmith Project: 2005 Status Report -- The Robot Scientist Project -- Algorithms and Software for Collaborative Discovery from Autonomous, Semantically Heterogeneous, Distributed Information Sources -- Training Support Vector Machines via SMO-Type Decomposition Methods -- Kernel-Based Learning -- Measuring Statistical Dependence with Hilbert-Schmidt Norms -- An Analysis of the Anti-learning Phenomenon for the Class Symmetric Polyhedron -- Learning Causal Structures Based on Markov Equivalence Class -- Stochastic Complexity for Mixture of Exponential Families in Variational Bayes -- ACME: An Associative Classifier Based on Maximum Entropy Principle -- Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors -- On Computability of Pattern Recognition Problems -- PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance -- Learnability of Probabilistic Automata via Oracles -- Learning Attribute-Efficiently with Corrupt Oracles -- Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution -- Learning of Elementary Formal Systems with Two Clauses Using Queries -- Gold-Style and Query Learning Under Various Constraints on the Target Class -- Non U-Shaped Vacillatory and Team Learning -- Learning Multiple Languages in Groups -- Inferring Unions of the Pattern Languages by the Most Fitting Covers -- Identification in the Limit of Substitutable Context-Free Languages -- Algorithms for Learning Regular Expressions -- A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data -- Absolute Versus Probabilistic Classification in a Logical Setting -- Online Allocation with Risk Information -- Defensive Universal Learning with Experts -- On Following the Perturbed Leader in the Bandit Setting -- Mixture of Vector Experts -- On-line Learning with Delayed Label Feedback -- Monotone Conditional Complexity Bounds on Future Prediction Errors -- Non-asymptotic Calibration and Resolution -- Defensive Prediction with Expert Advice -- Defensive Forecasting for Linear Protocols -- Teaching Learners with Restricted Mind Changes. |
| Record Nr. | UNISA-996466223003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma
| Algorithmic Learning Theory [[electronic resource] ] : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 348 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Computers Algorithms Mathematical logic Natural language processing (Computer science) Artificial Intelligence Programming Techniques Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN | 3-540-40992-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | INVITED LECTURES -- Extracting Information from the Web for Concept Learning and Collaborative Filtering -- The Divide-and-Conquer Manifesto -- Sequential Sampling Techniques for Algorithmic Learning Theory -- REGULAR CONTRIBUTIONS -- Towards an Algorithmic Statistics -- Minimum Message Length Grouping of Ordered Data -- Learning From Positive and Unlabeled Examples -- Learning Erasing Pattern Languages with Queries -- Learning Recursive Concepts with Anomalies -- Identification of Function Distinguishable Languages -- A Probabilistic Identification Result -- A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System -- Hypotheses Finding via Residue Hypotheses with the Resolution Principle -- Conceptual Classifications Guided by a Concept Hierarchy -- Learning Taxonomic Relation by Case-based Reasoning -- Average-Case Analysis of Classification Algorithms for Boolean Functions and Decision Trees -- Self-duality of Bounded Monotone Boolean Functions and Related Problems -- Sharper Bounds for the Hardness of Prototype and Feature Selection -- On the Hardness of Learning Acyclic Conjunctive Queries -- Dynamic Hand Gesture Recognition Based On Randomized Self-Organizing Map Algorithm -- On Approximate Learning by Multi-layered Feedforward Circuits -- The Last-Step Minimax Algorithm -- Rough Sets and Ordinal Classification -- A note on the generalization performance of kernel classifiers with margin -- On the Noise Model of Support Vector Machines Regression -- Computationally Efficient Transductive Machines. |
| Record Nr. | UNISA-996466193503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma
| Algorithmic Learning Theory : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 348 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Computers Algorithms Mathematical logic Natural language processing (Computer science) Artificial Intelligence Programming Techniques Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN | 3-540-40992-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | INVITED LECTURES -- Extracting Information from the Web for Concept Learning and Collaborative Filtering -- The Divide-and-Conquer Manifesto -- Sequential Sampling Techniques for Algorithmic Learning Theory -- REGULAR CONTRIBUTIONS -- Towards an Algorithmic Statistics -- Minimum Message Length Grouping of Ordered Data -- Learning From Positive and Unlabeled Examples -- Learning Erasing Pattern Languages with Queries -- Learning Recursive Concepts with Anomalies -- Identification of Function Distinguishable Languages -- A Probabilistic Identification Result -- A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System -- Hypotheses Finding via Residue Hypotheses with the Resolution Principle -- Conceptual Classifications Guided by a Concept Hierarchy -- Learning Taxonomic Relation by Case-based Reasoning -- Average-Case Analysis of Classification Algorithms for Boolean Functions and Decision Trees -- Self-duality of Bounded Monotone Boolean Functions and Related Problems -- Sharper Bounds for the Hardness of Prototype and Feature Selection -- On the Hardness of Learning Acyclic Conjunctive Queries -- Dynamic Hand Gesture Recognition Based On Randomized Self-Organizing Map Algorithm -- On Approximate Learning by Multi-layered Feedforward Circuits -- The Last-Step Minimax Algorithm -- Rough Sets and Ordinal Classification -- A note on the generalization performance of kernel classifiers with margin -- On the Noise Model of Support Vector Machines Regression -- Computationally Efficient Transductive Machines. |
| Record Nr. | UNINA-9910208853003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain
| Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XVII, 435 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer mathematics Numerical analysis Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computational Mathematics and Numerical Analysis Numeric Computing |
| ISBN | 3-540-69662-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Solving NP-hard combinatorial problems in the practical sense Invited presentation -- Airline crew-scheduling problem with many irregular flights -- Practical approach to a facility location problem for large-scale logistics -- Hard instance generation for SAT -- Playing tetris on meshes and multi-dimensional Shearsort -- Formulation of the addition-shift-sequence problem and its complexity -- Weighted and unweighted selection algorithms for k sorted sequences -- An adaptive distributed fault-tolerant routing algorithm for the star graph -- Multi-color routing in the undirected hypercube -- Competitive source routing on tori and meshes -- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs -- Augmenting edge and vertex connectivities simultaneously -- Two-face horn extensions -- Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae -- Algorithmic analysis of multithreaded algorithms -- A characterization of planar graphs by pseudo-line arrangements -- Optimal fault-tolerant broadcasting in trees -- A theoretical framework of hybrid approaches to MAX SAT -- Exponential lower bounds on the size of OBDDs representing integer division -- On-line versus off-line in money-making strategies with brokerage -- Decision-making by hierarchies of discordant agents -- A new efficient off-line anonymous cash scheme -- Approximating unweighted connectivity problems in parallel -- A randomized linear work EREW PRAM algorithm to find a minimum spanning forest -- Efficient parallel algorithms for planar st-graphs -- Peg-solitaire, string rewriting systems and finite automata -- On the size of probabilistic formulae -- Homophonic coding with logarithmic memory size -- Complexity and modeling aspects of mesh refinement into quadrilaterals -- Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm -- The complexity of learning branches and strategies from queries -- Singularities make spatial join scheduling hard -- A faster one-dimensional topological compaction algorithm -- Algorithms for finding optimal disjoint paths around a rectangle -- An algorithm for finding a region with the minimum total L 1 from prescribed terminals -- On defect sets in bipartite graphs (extended abstract) -- Dynamic programming on distance-hereditary graphs -- On the equivalence in complexity among basic problems on bipartite and parity graphs -- All-cavity maximum matchings -- Fast algorithms for computing ?-Skeletons and their relatives -- A branch-and-cut approach for minimum weight triangulation -- An efficient approximation scheme for the subset-sum problem -- Competitive call control in mobile networks -- Generalized swap-with-parent schemes for self-organizing sequential linear lists. |
| Record Nr. | UNINA-9910144902203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain
| Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XVII, 435 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer mathematics Numerical analysis Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computational Mathematics and Numerical Analysis Numeric Computing |
| ISBN | 3-540-69662-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Solving NP-hard combinatorial problems in the practical sense Invited presentation -- Airline crew-scheduling problem with many irregular flights -- Practical approach to a facility location problem for large-scale logistics -- Hard instance generation for SAT -- Playing tetris on meshes and multi-dimensional Shearsort -- Formulation of the addition-shift-sequence problem and its complexity -- Weighted and unweighted selection algorithms for k sorted sequences -- An adaptive distributed fault-tolerant routing algorithm for the star graph -- Multi-color routing in the undirected hypercube -- Competitive source routing on tori and meshes -- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs -- Augmenting edge and vertex connectivities simultaneously -- Two-face horn extensions -- Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae -- Algorithmic analysis of multithreaded algorithms -- A characterization of planar graphs by pseudo-line arrangements -- Optimal fault-tolerant broadcasting in trees -- A theoretical framework of hybrid approaches to MAX SAT -- Exponential lower bounds on the size of OBDDs representing integer division -- On-line versus off-line in money-making strategies with brokerage -- Decision-making by hierarchies of discordant agents -- A new efficient off-line anonymous cash scheme -- Approximating unweighted connectivity problems in parallel -- A randomized linear work EREW PRAM algorithm to find a minimum spanning forest -- Efficient parallel algorithms for planar st-graphs -- Peg-solitaire, string rewriting systems and finite automata -- On the size of probabilistic formulae -- Homophonic coding with logarithmic memory size -- Complexity and modeling aspects of mesh refinement into quadrilaterals -- Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm -- The complexity of learning branches and strategies from queries -- Singularities make spatial join scheduling hard -- A faster one-dimensional topological compaction algorithm -- Algorithms for finding optimal disjoint paths around a rectangle -- An algorithm for finding a region with the minimum total L 1 from prescribed terminals -- On defect sets in bipartite graphs (extended abstract) -- Dynamic programming on distance-hereditary graphs -- On the equivalence in complexity among basic problems on bipartite and parity graphs -- All-cavity maximum matchings -- Fast algorithms for computing ?-Skeletons and their relatives -- A branch-and-cut approach for minimum weight triangulation -- An efficient approximation scheme for the subset-sum problem -- Competitive call control in mobile networks -- Generalized swap-with-parent schemes for self-organizing sequential linear lists. |
| Record Nr. | UNISA-996466078903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Proceedings of the 2018 Winter Simulation Conference / / Björn Johansson, Sanjay Jain
| Proceedings of the 2018 Winter Simulation Conference / / Björn Johansson, Sanjay Jain |
| Autore | Johansson Björn |
| Pubbl/distr/stampa | Piscataway, NJ, USA : , : IEEE Press, , 2018 |
| Descrizione fisica | 1 online resource (4298 pages) |
| Disciplina | 004 |
| Soggetto topico | Computer science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910412270303321 |
Johansson Björn
|
||
| Piscataway, NJ, USA : , : IEEE Press, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings / / edited by Rahul Jain, Sanjay Jain, Frank Stephan
| Theory and Applications of Models of Computation [[electronic resource] ] : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings / / edited by Rahul Jain, Sanjay Jain, Frank Stephan |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 466 p. 83 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Algorithms Computer science Data structures (Computer science) Information theory Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory |
| ISBN | 3-319-17142-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recursion theory and mathematical logic -- Computational complexity and Boolean functions -- Graph theory -- Quantum computing -- Parallelism and statistics -- Learning, automata and probabilistic models -- Parameterised complexity. |
| Record Nr. | UNISA-996208604103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings / / edited by Rahul Jain, Sanjay Jain, Frank Stephan
| Theory and Applications of Models of Computation : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings / / edited by Rahul Jain, Sanjay Jain, Frank Stephan |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 466 p. 83 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Algorithms Computer science Data structures (Computer science) Information theory Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Data Structures and Information Theory |
| ISBN | 3-319-17142-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recursion theory and mathematical logic -- Computational complexity and Boolean functions -- Graph theory -- Quantum computing -- Parallelism and statistics -- Learning, automata and probabilistic models -- Parameterised complexity. |
| Record Nr. | UNINA-9910484640103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||