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.
Computer algebra in scientific computing : 11th international workshop, CASC 2009, Kobe, Japan, September 13-17, 2009 : proceedings / / Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.)
Computer algebra in scientific computing : 11th international workshop, CASC 2009, Kobe, Japan, September 13-17, 2009 : proceedings / / Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.)
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin ; ; New York, : Springer, c2009
Descrizione fisica 1 online resource (XI, 393 p.)
Disciplina 005.131
Altri autori (Persone) GerdtVladimir P
MayrErnst
VorozhtsovE. V <1946-> (Evgenii Vasilevich)
Collana Lecture notes in computer science
Soggetto topico Algebra - Data processing
Science - Data processing
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. UNINA-9910483934403321
Berlin ; ; New York, : Springer, c2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computer Algebra in Scientific Computing [[electronic resource] ] : 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings / / edited by V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov
Computer Algebra in Scientific Computing [[electronic resource] ] : 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings / / edited by V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (XIII, 460 p.)
Disciplina 512.00285
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Computer programming
Discrete mathematics
Algorithms
Symbolic and Algebraic Manipulation
Programming Techniques
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
ISBN 3-540-75187-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Analytic Solutions of Linear Difference Equations, Formal Series, and Bottom Summation -- Computations in Modules over Commutative Domains -- Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds -- An Efficient LLL Gram Using Buffered Transformations -- On the Computation of A ???-Maps -- Algebraic Visualization of Relations Using RelView -- Comprehensive Triangular Decomposition -- Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations -- A Symbolic-Numerical Algorithm for Solving the Eigenvalue Problem for a Hydrogen Atom in the Magnetic Field: Cylindrical Coordinates -- An Algorithm for Construction of Normal Forms -- Computer Algebra: A ‘Classical’ Path to Explore Decoherence and Entanglement Phenomena in Quantum Information Theory -- Deducing the Constraints in the Light-Cone SU(3) Yang-Mills Mechanics Via Gröbner Bases -- On the Weight Spectra of Conway Matrices Related to the Non-transitive Head-or-Tail Game -- Properties of the Liapunov Stability Zones of the Lagrange Triangle -- Studying the Stability of the Second Order Non-autonomous Hamiltonian System -- On the Peculiar Properties of Families of Invariant Manifolds of Conservative Systems -- A Unified Algorithm for Multivariate Analytic Factorization -- On the Computation of the Defining Polynomial of the Algebraic Riccati Equation -- Symmetries and Dynamics of Discrete Systems -- Exact Solutions of Completely Integrable Systems and Linear ODE’s Having Elliptic Function Coefficients -- Dynamics of Nonlinear Parabolic Equations with Cosymmetry -- Weak Integer Quantifier Elimination Beyond the Linear Case -- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors -- Ruppert Matrix as Subresultant Mapping -- Construction of Computer System for Microobjects Recognition Based on Neural Networks -- Analytical Solution for Transient Flow of a Generalized Bingham Fluid with Memory in a Movable Tube Using Computer Algebra -- Some Elimination Problems for Matrices -- A Full System of Invariants for Third-Order Linear Partial Differential Operators in General Form -- Automatic Stability Analysis for a Diffusion Equation with Memories Using Maple -- Bounds for Real Roots and Applications to Orthogonal Polynomials -- Distance Computation from an Ellipsoid to a Linear or a Quadric Surface in IR n -- Robust Stability for Parametric Linear ODEs -- Symbolic and Algebraic Methods for Linear Partial Differential Operators -- A New Scheme for Deniable/Repudiable Authentication -- An Algebraic-Numeric Algorithm for the Model Selection in Kinetic Networks -- On the Representation of the Differential Operator in Bases of Periodic Coiflets and It’s Application.
Record Nr. UNISA-996466096103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computer Algebra in Scientific Computing : 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings / / edited by V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov
Computer Algebra in Scientific Computing : 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings / / edited by V.G. Ganzha, E.W. Mayr, E.V. Vorozhtsov
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (XIII, 460 p.)
Disciplina 512.00285
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Computer programming
Discrete mathematics
Algorithms
Symbolic and Algebraic Manipulation
Programming Techniques
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
ISBN 3-540-75187-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Analytic Solutions of Linear Difference Equations, Formal Series, and Bottom Summation -- Computations in Modules over Commutative Domains -- Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds -- An Efficient LLL Gram Using Buffered Transformations -- On the Computation of A ???-Maps -- Algebraic Visualization of Relations Using RelView -- Comprehensive Triangular Decomposition -- Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations -- A Symbolic-Numerical Algorithm for Solving the Eigenvalue Problem for a Hydrogen Atom in the Magnetic Field: Cylindrical Coordinates -- An Algorithm for Construction of Normal Forms -- Computer Algebra: A ‘Classical’ Path to Explore Decoherence and Entanglement Phenomena in Quantum Information Theory -- Deducing the Constraints in the Light-Cone SU(3) Yang-Mills Mechanics Via Gröbner Bases -- On the Weight Spectra of Conway Matrices Related to the Non-transitive Head-or-Tail Game -- Properties of the Liapunov Stability Zones of the Lagrange Triangle -- Studying the Stability of the Second Order Non-autonomous Hamiltonian System -- On the Peculiar Properties of Families of Invariant Manifolds of Conservative Systems -- A Unified Algorithm for Multivariate Analytic Factorization -- On the Computation of the Defining Polynomial of the Algebraic Riccati Equation -- Symmetries and Dynamics of Discrete Systems -- Exact Solutions of Completely Integrable Systems and Linear ODE’s Having Elliptic Function Coefficients -- Dynamics of Nonlinear Parabolic Equations with Cosymmetry -- Weak Integer Quantifier Elimination Beyond the Linear Case -- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors -- Ruppert Matrix as Subresultant Mapping -- Construction of Computer System for Microobjects Recognition Based on Neural Networks -- Analytical Solution for Transient Flow of a Generalized Bingham Fluid with Memory in a Movable Tube Using Computer Algebra -- Some Elimination Problems for Matrices -- A Full System of Invariants for Third-Order Linear Partial Differential Operators in General Form -- Automatic Stability Analysis for a Diffusion Equation with Memories Using Maple -- Bounds for Real Roots and Applications to Orthogonal Polynomials -- Distance Computation from an Ellipsoid to a Linear or a Quadric Surface in IR n -- Robust Stability for Parametric Linear ODEs -- Symbolic and Algebraic Methods for Linear Partial Differential Operators -- A New Scheme for Deniable/Repudiable Authentication -- An Algebraic-Numeric Algorithm for the Model Selection in Kinetic Networks -- On the Representation of the Differential Operator in Bases of Periodic Coiflets and It’s Application.
Record Nr. UNINA-9910484100603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computer algebra in scientific computing : 9th international workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006 ; proceedings / / Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.)
Computer algebra in scientific computing : 9th international workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006 ; proceedings / / Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.)
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, : Springer, 2006
Descrizione fisica 1 online resource (XII, 314 p.)
Disciplina 512.00285
Altri autori (Persone) GanzhaV. G <1956-> (Victor Grigorevich)
MayrErnst
VorozhtsovE. V <1946-> (Evgenii Vasilevich)
Collana Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Soggetto topico Algebra - Data processing
Science - Data processing
ISBN 3-540-45195-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Comparison Maps for Relatively Free Resolutions -- A Symbolic-Numeric Approach for Solving the Eigenvalue Problem for the One-Dimensional Schrödinger Equation -- Reducing Computational Costs in the Basic Perturbation Lemma -- Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView -- Intervals, Syzygies, Numerical Gröbner Bases: A Mixed Study -- Application of Computer Algebra for Construction of Quasi-periodic Solutions for Restricted Circular Planar Three Body Problem -- Efficient Preprocessing Methods for Quantifier Elimination -- Symbolic and Numerical Calculation of Transport Integrals for Some Organic Crystals -- On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions -- Providing Modern Software Environments to Computer Algebra Systems -- The Instability of the Rhombus-Like Central Configurations in Newton 9-Body Problem -- Algorithmic Invariants for Alexander Modules -- Sudokus and Gröbner Bases: Not Only a Divertimento -- Simplicial Perturbation Techniques and Effective Homology -- Numerical Study of Stability Domains of Hamiltonian Equation Solutions -- Numeric-Symbolic Computations in the Study of Central Configurations in the Planar Newtonian Four-Body Problem -- A Symbolic-Numerical Algorithm for Solving the Eigenvalue Problem for a Hydrogen Atom in Magnetic Field -- On Decomposition of Tame Polynomials and Rational Functions -- Newton Polyhedra and an Oscillation Index of Oscillatory Integrals with Convex Phases -- Cellular Automata with Symmetric Local Rules -- Parallel Laplace Method with Assured Accuracy for Solutions of Differential Equations by Symbolic Computations -- On Connection Between Constructive Involutive Divisions and Monomial Orderings -- A Symbolic-Numeric Approach to Tube Modeling in CAD Systems -- Inequalities on Upper Bounds for Real Polynomial Roots -- New Domains for Applied Quantifier Elimination -- Algorithms for Symbolic Polynomials -- Testing Mersenne Primes with Elliptic Curves.
Altri titoli varianti CASC 2006
Record Nr. UNINA-9910768175603321
Berlin, : Springer, 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computer algebra in scientific computing : 8th International Workshop, CSAC 2005, Kalamata, Greece, September 12-16, 2005 : proceedings / / Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.)
Computer algebra in scientific computing : 8th International Workshop, CSAC 2005, Kalamata, Greece, September 12-16, 2005 : proceedings / / Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov (eds.)
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, : Springer, 2005
Descrizione fisica 1 online resource (XII, 504 p.)
Disciplina 512.00285
Altri autori (Persone) GanzhaV. G <1956-> (Victor Grigorevich)
MayrErnst
VorozhtsovE. V <1946-> (Evgenii Vasilevich)
Collana Lecture notes in computer science
Soggetto topico Algebra - Data processing
Science - Data processing
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. UNINA-9910483066903321
Berlin, : Springer, 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 : proceedings / / [edited by] Farid Ablayev, Ernst W. Mayr
Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 : proceedings / / [edited by] Farid Ablayev, Ernst W. Mayr
Edizione [1st ed.]
Pubbl/distr/stampa New York, : Springer, 2010
Descrizione fisica 1 online resource (XI, 397 p. 49 illus.)
Disciplina 004.0151
Altri autori (Persone) AblayevFarid
MayrErnst
Collana Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Soggetto topico Computer science
Computer science - Russia (Federation)
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.
Altri titoli varianti CSR 2010
Record Nr. UNINA-9910483768903321
New York, : Springer, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Lectures on proof verification and approximation algorithms / / Ernst W. Mayr, Hans Jurgen Promel, Angelika Steger (eds.)
Lectures on proof verification and approximation algorithms / / Ernst W. Mayr, Hans Jurgen Promel, Angelika Steger (eds.)
Edizione [1st ed. 1998.]
Pubbl/distr/stampa Berlin ; ; Heidelberg : , : Springer, , [1998]
Descrizione fisica 1 online resource (XII, 348 p.)
Disciplina 003.54
Collana Lecture Notes in Computer Science
Soggetto topico Computer software
Information theory
ISBN 3-540-69701-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto to the theory of complexity and approximation algorithms -- to randomized algorithms -- Derandomization -- Proof checking and non-approximability -- Proving the PCP-Theorem -- Parallel repetition of MIP(2,1) systems -- Bounds for approximating MaxLinEq3-2 and MaxEkSat -- Deriving non-approximability results by reductions -- Optimal non-approximability of MaxClique -- The hardness of approximating set cover -- Semidefinite programming and its applications to approximation algorithms -- Dense instances of hard optimization problems -- Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces.
Record Nr. UNINA-9910143457403321
Berlin ; ; Heidelberg : , : Springer, , [1998]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Lectures on proof verification and approximation algorithms / / Ernst W. Mayr, Hans Jurgen Promel, Angelika Steger (eds.)
Lectures on proof verification and approximation algorithms / / Ernst W. Mayr, Hans Jurgen Promel, Angelika Steger (eds.)
Edizione [1st ed. 1998.]
Pubbl/distr/stampa Berlin ; ; Heidelberg : , : Springer, , [1998]
Descrizione fisica 1 online resource (XII, 348 p.)
Disciplina 003.54
Collana Lecture Notes in Computer Science
Soggetto topico Computer software
Information theory
ISBN 3-540-69701-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto to the theory of complexity and approximation algorithms -- to randomized algorithms -- Derandomization -- Proof checking and non-approximability -- Proving the PCP-Theorem -- Parallel repetition of MIP(2,1) systems -- Bounds for approximating MaxLinEq3-2 and MaxEkSat -- Deriving non-approximability results by reductions -- Optimal non-approximability of MaxClique -- The hardness of approximating set cover -- Semidefinite programming and its applications to approximation algorithms -- Dense instances of hard optimization problems -- Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces.
Record Nr. UNISA-996466136803316
Berlin ; ; Heidelberg : , : Springer, , [1998]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui