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.
Computer Algebra in Scientific Computing [[electronic resource] ] : 15th International Workshop, CASC 2013, Berlin, Germany, September 9-13, 2013, Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing [[electronic resource] ] : 15th International Workshop, CASC 2013, Berlin, Germany, September 9-13, 2013, Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 443 p. 58 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer arithmetic and logic units Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Computer Graphics Numerical Analysis Arithmetic and Logic Structures |
| ISBN | 3-319-02297-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polynomial algebra -- the solution of tropical linear systems and tropical polynomial systems -- the theory of matrices -- the use of computer algebra for the investigation of various mathematical and applied topics related to ordinary differential equations -- applications of symbolic computations for solving partial differential equations in mathematical physics -- problems arising at the application of computer algebra methods for finding infinitesimal symmetries -- applications of symbolic and symbolic-numeric algorithms in mechanics and physics -- automatic differentiation -- the application of the CAS Mathematica for the simulation of quantum error correction in quantum computing -- the application of the CAS GAP for the enumeration of Schur rings over the group A5 -- constructive computation of zero separation bounds for arithmetic expressions -- the parallel implementation of fast Fourier transforms with the aid of the Spiral library generation system -- the use of object-oriented languages such as Java or Scala for implementation of categories as type classes -- a survey of industrial applications of approximate computer algebra. |
| Record Nr. | UNISA-996466014503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Algebra in Scientific Computing : 15th International Workshop, CASC 2013, Berlin, Germany, September 9-13, 2013, Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing : 15th International Workshop, CASC 2013, Berlin, Germany, September 9-13, 2013, Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 443 p. 58 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer arithmetic and logic units Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Computer Graphics Numerical Analysis Arithmetic and Logic Structures |
| ISBN | 3-319-02297-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polynomial algebra -- the solution of tropical linear systems and tropical polynomial systems -- the theory of matrices -- the use of computer algebra for the investigation of various mathematical and applied topics related to ordinary differential equations -- applications of symbolic computations for solving partial differential equations in mathematical physics -- problems arising at the application of computer algebra methods for finding infinitesimal symmetries -- applications of symbolic and symbolic-numeric algorithms in mechanics and physics -- automatic differentiation -- the application of the CAS Mathematica for the simulation of quantum error correction in quantum computing -- the application of the CAS GAP for the enumeration of Schur rings over the group A5 -- constructive computation of zero separation bounds for arithmetic expressions -- the parallel implementation of fast Fourier transforms with the aid of the Spiral library generation system -- the use of object-oriented languages such as Java or Scala for implementation of categories as type classes -- a survey of industrial applications of approximate computer algebra. |
| Record Nr. | UNINA-9910483834503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Algebra in Scientific Computing [[electronic resource] ] : 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing [[electronic resource] ] : 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XIV, 363 p. 42 illus.) |
| Disciplina | 004.01/51 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer arithmetic and logic units Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Computer Graphics Numerical Analysis Arithmetic and Logic Structures |
| ISBN | 3-642-32973-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On Polynomial Solutions of Linear Partial Differential and (q-)Difference Equations -- An Algebraic Characterization of Rainbow Connectivity -- Application of the Method of Asymptotic Solution to One Multi-Parameter Problem -- A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers -- Lightweight Abstraction for Mathematical Computation in Java -- Calculation of Normal Forms of the Euler–Poisson Equations -- Stability of Equilibrium Positions in the Spatial Circular Restricted Four-Body Problem -- Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates -- Comprehensive Involutive Systems -- A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials -- The Resonant Center Problem for a 2:-3 Resonant Cubic Lotka–Volterra System -- Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics Symbolic-Numerical Calculations of -- High-|m| Rydberg States and Decay Rates in Strong Magnetic Fields -- Quasi-stability versus Genericity -- Invariant Theory: Applications and Computations (Invited Talk) -- Local Generic Position for Root Isolation of Zero-Dimensional Triangular Polynomial Systems -- On Fulton’s Algorithm for Computing Intersection Multiplicities -- A Note on the Space Complexity of Fast D-Finite Function Evaluation -- Inversion Modulo Zero-Dimensional Regular Chains -- Sparse Polynomial Powering Using Heaps -- Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems -- Parallel Reduction of Matrices in Gr¨obner Bases Computations -- Real and Complex Polynomial Root-Finding by Means of Eigen-Solving -- Root-Refining for a Polynomial Equation -- PoCaB: A Software Infrastructure to Explore Algebraic Methods for Bio-chemical Reaction Networks -- Approximately Singular Systems and Ill-Conditioned Polynomial Systems -- Symbolic-Numeric Implementation of the Method of Collocations and Least Squares for 3D Navier–Stokes Equations -- Verifiable Conditions on Asymptotic Stabilisability for a Class of Planar Switched Linear Systems -- Improving Angular Speed Uniformity by Optimal C0 Piecewise Reparameterization -- Usage of Modular Techniques for Efficient Computation of Ideal Operations (Invited Talk). |
| Record Nr. | UNISA-996465277903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Algebra in Scientific Computing [[electronic resource] ] : 13th International Workshop, CASC 2011, Kassel, Germany, September 5-9, 2011. Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing [[electronic resource] ] : 13th International Workshop, CASC 2011, Kassel, Germany, September 5-9, 2011. Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XI, 359 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer graphics Numerical analysis Computer arithmetic and logic units Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Arithmetic and Logic Structures |
| ISBN | 3-642-23568-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recurrent method for constructing irreducible polynomials over finite fields / Sergey Abrahamyan, Melsik Kyureghyan -- Higher-order linear differential systems with truncated coefficients / S.A. Abramov, M.A. Barkatou, E. Pflugel. |
| Record Nr. | UNISA-996466005103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Algebra in Scientific Computing [[electronic resource] ] : 12th International Workshop, CASC 2010, Tsakhadzor, Armenia, September 6-12, 2010, Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing [[electronic resource] ] : 12th International Workshop, CASC 2010, Tsakhadzor, Armenia, September 6-12, 2010, Proceedings / / edited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIV, 304 p. 48 illus.) |
| Disciplina | 518 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Computer programming Computer science Discrete mathematics Algorithms Computer graphics Symbolic and Algebraic Manipulation Programming Techniques Theory of Computation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN |
1-280-38841-2
9786613566331 3-642-15274-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Construction of Irreducible Polynomials over Finite Fields -- Factorization of Polynomials and GCD Computations for Finding Universal Denominators -- A Role of Symbolic Computations in Beam Physics -- Thomas Decomposition of Algebraic and Differential Systems -- On Multivariate Homogeneous Polynomial Decomposition -- Computing Matrix Representations of Filiform Lie Algebras -- Type Specialization in Aldor -- An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models -- On Sufficient Conditions for Integrability of a Planar System of ODEs Near a Degenerate Stationary Point -- Symbolic-Numeric Algorithms for Computer Analysis of Spheroidal Quantum Dot Models -- On Reduction of Lagrange Systems -- Series Transformations to Improve and Extend Convergence -- Differential Resultant, Computer Algebra and Completely Integrable Dynamical Systems -- Generic, Type-Safe and Object Oriented Computer Algebra Software -- Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden -- Fast Generalized Bruhat Decomposition -- Computational Science in Armenia (Invited Talk) -- From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk) -- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests -- Term Cancellations in Computing Floating-Point Gröbner Bases -- One Class of Third-Order Linear ODE’s -- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials -- Derivation of Explicit Difference Schemes for Ordinary Differential Equations with the Aid of Lagrange–Burmann Expansions -- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk) -- An Analytical Model for the Probability Characteristics of a Crack Hitting an Encapsulated Self-healing Agent in Concrete -- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases. |
| Record Nr. | UNISA-996465941203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Algebra in Scientific Computing [[electronic resource] ] : 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009, Proceedings / / edited by Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing [[electronic resource] ] : 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009, Proceedings / / edited by Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 393 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Computer software Mathematics—Data processing Computer programming Discrete mathematics Algorithms Symbolic and Algebraic Manipulation Mathematical Software Computational Mathematics and Numerical Analysis Programming Techniques Discrete Mathematics in Computer Science |
| ISBN | 3-642-04103-5 |
| Classificazione |
DAT 702f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On m-Interlacing Solutions of Linear Difference Equations -- Parametric Analysis of Stability Conditions for a Satellite with Gyrodines -- Computing and Visualizing Closure Objects Using Relation Algebra and RelView -- On Integrability of a Planar ODE System Near a Degenerate Stationary Point -- Conditions of D-Stability of the Fifth-Order Matrices -- Code Generation for Polynomial Multiplication -- Solving Structured Polynomial Systems and Applications to Cryptology -- The Comparison Method of Physical Quantity Dimensionalities -- Ambient Isotopic Meshing for Implicit Algebraic Surfaces with Singularities -- Involution and Difference Schemes for the Navier–Stokes Equations -- A Mathematica Package for Simulation of Quantum Computation -- On Computing the Hermite Form of a Matrix of Differential Polynomials -- On the Computation of Comprehensive Boolean Gröbner Bases -- On Invariant Manifolds of Dynamical Systems in Lie Algebras -- On the Complexity of Reliable Root Approximation -- Algebraic Approach to the Computation of the Defining Polynomial of the Algebraic Riccati Equation -- Discrete Dynamics: Gauge Invariance and Quantization -- Effective Quantifier Elimination for Presburger Arithmetic with Infinity -- An Algorithm for Symbolic Solving of Differential Equations and Estimation of Accuracy -- Lazy and Forgetful Polynomial Arithmetic and Applications -- On the Average Growth Rate of Random Compositions of Fibonacci and Padovan Recurrences -- A Study on Gröbner Basis with Inexact Input -- Modular Algorithms for Computing a Generating Set of the Syzygy Module -- A Symbolic Framework for Operations on Linear Boundary Problems -- Mathematical Model for Dengue Epidemics with Differential Susceptibility and Asymptomatic Patients Using Computer Algebra -- Multiple Factorizations of Bivariate Linear Partial Differential Operators -- Computing Gröbner Bases within Linear Algebra -- A Mimetic Finite-Difference Scheme for Convection of Multicomponent Fluid in a Porous Medium -- Symbolic-Numerical Algorithms for Solving Parabolic Quantum Well Problem with Hydrogen-Like Impurity -- New Analytic Solutions of the Problem of Gas Flow in a Casing with Rotating Disc -- Hybrid Solution of Two-Point Linear Boundary Value Problems. |
| Record Nr. | UNISA-996465665003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Algebra in Scientific Computing [[electronic resource] ] : 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings / / edited by Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing [[electronic resource] ] : 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings / / edited by Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 504 p.) |
| Disciplina | 512.00285 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Algebra Computer programming Discrete mathematics Algorithms Mathematics of Computing Symbolic and Algebraic Manipulation Programming Techniques Discrete Mathematics in Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On Regular and Logarithmic Solutions of Ordinary Linear Differential Systems -- Computing the Betti Numbers of Arrangements in Practice -- A MAPLE Symbolic-Numeric Program for Solving the 2D-Eigenvalue Problem by a Self-consistent Basis Method -- RelView – An OBDD-Based Computer Algebra System for Relations -- On the Use of Gröbner Bases for Computing the Structure of Finite Abelian Groups -- Normal Forms and Integrability of ODE Systems -- Resultant-Based Methods for Plane Curves Intersection Problems -- Symbolic Calculations in Studying the Stability of Dynamically Symmetric Satellite Motion -- Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time -- Computer Algebra in Nanosciences: Modeling Electronic States in Quantum Dots -- Cayley-Dixon Resultant Matrices of Multi-univariate Composed Polynomials -- A Descartes Algorithm for Polynomials with Bit-Stream Coefficients -- Real Solving of Bivariate Polynomial Systems -- Nouvelle Cuisine for the Computation of the Annihilating Ideal of f s -- Janet-Like Monomial Division -- Janet-Like Gröbner Bases -- Circulant Digraphs and Monomial Ideals -- Algebraic Topological Analysis of Time-Sequence of Digital Images -- Hilbert Stratification and Parametric Gröbner Bases -- Investigation of the Stability Problem for the Critical Cases of the Newtonian Many-Body Problem -- Symbolic-Numerical Algorithm for Solving the Time-Dependent Schrödinger Equation by Split-Operator Method -- On Some Results of Investigation of Kirchhoff Equations in Case of a Rigid Body Motion in Fluid -- On Compatibility of Discrete Relations -- Construction of Two Level Orthogonal Arrays Via Solutions of Linear Systems -- Counting Techniques Specifying the Existence of Submatrices in Weighing Matrices -- Fast Verification for Respective Eigenvalues of Symmetric Matrix -- Towards More Accurate Separation Bounds of Empirical Polynomials II -- Compiler-Enforced Memory Semantics in the SACLIB Computer Algebra Library -- Meta-Petro: An Expert System for Training Undergraduates in Metamorphic Rocks Recognition and Classification Using Photomicrographies -- The Diamond Operator – Implementation of Exact Real Algebraic Numbers -- Constructing the Numerical Method for Navier — Stokes Equations Using Computer Algebra System -- Nonlinear Waves in a Rod -- A Symbolic-Numeric Method for Solving Boundary Value Problems of Kirchhoff Rods -- Differential and Difference Equations for Products of Classical Orthogonal Polynomials -- Algorithm of Local Resolution of Singularities of a Space Curve -- Quantifier Elimination for Constraint Logic Programming -- Computation of Full Comprehensive Gröbner Bases -- Recursive Polynomial Remainder Sequence and the Nested Subresultants -- Interdependence Between the Laurent-Series and Elliptic Solutions of Nonintegrable Systems -- Solving Linear Differential Problems with Parameters -- Approximate Solution of the Dirichlet Problem for Elliptic PDE and Its Error Estimate. |
| Record Nr. | UNISA-996465615803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science -- Theory and Applications [[electronic resource] ] : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings / / edited by Farid M. Ablaev, Ernst W. Mayr
| Computer Science -- Theory and Applications [[electronic resource] ] : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings / / edited by Farid M. Ablaev, Ernst W. Mayr |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XI, 397 p. 49 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Computer science—Mathematics Discrete mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Discrete Mathematics in Computer Science |
| ISBN |
1-280-38667-3
9786613564597 3-642-13182-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Energy Management -- Sofic and Almost of Finite Type Tree-Shifts -- Proof-Based Design of Security Protocols -- Approximating the Minimum Length of Synchronizing Words Is Hard -- Realizability of Dynamic MSC Languages -- The max quasi-independent set Problem -- Equilibria in Quantitative Reachability Games -- Quotient Complexity of Closed Languages -- Right-Sequential Functions on Infinite Words -- Kernelization -- Zigzags in Turing Machines -- Frameworks for Logically Classifying Polynomial-Time Optimisation Problems -- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online -- Identical Relations in Symmetric Groups and Separating Words with Reversible Automata -- Time Optimal d-List Colouring of a Graph -- The Cantor Space as a Generic Model of Topologically Presented Knowledge -- Algorithmics – Is There Hope for a Unified Theory? -- Classifying Rankwidth k-DH-Graphs -- Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms -- A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem -- Balancing Bounded Treewidth Circuits -- Obtaining Online Ecological Colourings by Generalizing First-Fit -- Classical Simulation and Complexity of Quantum Computations -- Prefix-Free and Prefix-Correct Complexities with Compound Conditions -- Monotone Complexity of a Pair -- Symbolic Models for Single-Conclusion Proof Logics -- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA -- Advancing Matrix Computations with Randomized Preprocessing -- Transfinite Sequences of Constructive Predicate Logics -- The Quantitative Analysis of User Behavior Online — Data, Models and Algorithms -- A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem -- Complexity of Propositional Proofs -- Quantization of Random Walks: Search Algorithms and Hitting Time -- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems -- Growth of Power-Free Languages over Large Alphabets -- A Partially Synchronizing Coloring -- An Encoding Invariant Version of Polynomial Time Computable Distributions -- Prehistoric Phenomena and Self-referentiality. |
| Record Nr. | UNISA-996465855203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers / / edited by Ernst W. Mayr
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers / / edited by Ernst W. Mayr |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XIV, 514 p. 106 illus.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer graphics Geometry Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN | 3-662-53174-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics -- Open Problems on Graph Coloring for Special Graph Classes -- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks -- Computational Complexity -- The Stable Fixtures Problem with Payments -- Complexity of Secure Sets -- Efficient Domination for Some Subclasses of P6-free Graphs in Polynomial Time -- On the Tree Search Problem with Non-uniform Costs -- An O(n2) Time Algorithm for the Minimal Permutation Completion Problem -- On the Number of Minimal Separators in Graphs -- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks -- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs -- Finding Paths in Grids with Forbidden Transitions -- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results -- Design and Analysis -- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes -- Approximating Source Location and Star Survivable Network Problems -- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph -- Computational Geometry -- Weak Unit Disk and Interval Representation of Graphs -- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes -- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes -- Unsplittable Coverings in the Plane -- Structural Graph Theory -- Induced Minor Free Graphs: Isomorphism and Clique-width -- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs -- Colouring and Covering Nowhere Dense Graphs -- Parity Linkage and the Erdös-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs -- Well-quasi-ordering Does Not Imply Bounded Clique-width -- A Slice Theoretic Approach for Embedding Problems on Digraphs -- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs -- Graph Drawing -- Saturated Simple and 2-simple Topological Graphs with Few Edges -- Testing Full Outer-2-planarity in Linear Time -- Fixed Parameter Tractability -- Triangulating Planar Graphs While Keeping the Pathwidth Small -- Polynomial Kernelization for Removing Induced Claws and Diamonds -- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs -- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT -- Recognizing k-equistable Graphs in FPT Time -- Beyond Classes of Graphs with \Few" Minimal Separators: FPT -- Results Through Potential Maximal Cliques. |
| Record Nr. | UNISA-996465339703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers / / edited by Ernst W. Mayr
| Graph-Theoretic Concepts in Computer Science : 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers / / edited by Ernst W. Mayr |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XIV, 514 p. 106 illus.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer graphics Geometry Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN | 3-662-53174-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics -- Open Problems on Graph Coloring for Special Graph Classes -- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks -- Computational Complexity -- The Stable Fixtures Problem with Payments -- Complexity of Secure Sets -- Efficient Domination for Some Subclasses of P6-free Graphs in Polynomial Time -- On the Tree Search Problem with Non-uniform Costs -- An O(n2) Time Algorithm for the Minimal Permutation Completion Problem -- On the Number of Minimal Separators in Graphs -- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks -- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs -- Finding Paths in Grids with Forbidden Transitions -- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results -- Design and Analysis -- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes -- Approximating Source Location and Star Survivable Network Problems -- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph -- Computational Geometry -- Weak Unit Disk and Interval Representation of Graphs -- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes -- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes -- Unsplittable Coverings in the Plane -- Structural Graph Theory -- Induced Minor Free Graphs: Isomorphism and Clique-width -- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs -- Colouring and Covering Nowhere Dense Graphs -- Parity Linkage and the Erdös-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs -- Well-quasi-ordering Does Not Imply Bounded Clique-width -- A Slice Theoretic Approach for Embedding Problems on Digraphs -- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs -- Graph Drawing -- Saturated Simple and 2-simple Topological Graphs with Few Edges -- Testing Full Outer-2-planarity in Linear Time -- Fixed Parameter Tractability -- Triangulating Planar Graphs While Keeping the Pathwidth Small -- Polynomial Kernelization for Removing Induced Claws and Diamonds -- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs -- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT -- Recognizing k-equistable Graphs in FPT Time -- Beyond Classes of Graphs with \Few" Minimal Separators: FPT -- Results Through Potential Maximal Cliques. |
| Record Nr. | UNINA-9910483718203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
