24 resultater (0,23128 sekunder)

Mærke

Butik

Pris (EUR)

Nulstil filter

Produkter
Fra
Butikker

String Processing and Information Retrieval - - Bog - Springer International Publishing AG - Plusbog.dk

String Processing and Information Retrieval - - Bog - Springer International Publishing AG - Plusbog.dk

Introduction to String Theory - Sergio Cecotti - Bog - Springer International Publishing AG - Plusbog.dk

Classical and Quantum Cosmology - Gianluca Calcagni - Bog - Springer International Publishing AG - Plusbog.dk

WALCOM: Algorithms and Computation - - Bog - Springer International Publishing AG - Plusbog.dk

Language and Automata Theory and Applications - - Bog - Springer International Publishing AG - Plusbog.dk

Language and Automata Theory and Applications - - Bog - Springer International Publishing AG - Plusbog.dk

Fundamentals of Java Programming - Mitsunori Ogihara - Bog - Springer International Publishing AG - Plusbog.dk

Managing COPD - - Bog - Springer International Publishing AG - Plusbog.dk

Database Systems for Advanced Applications - - Bog - Springer International Publishing AG - Plusbog.dk

Database Systems for Advanced Applications - - Bog - Springer International Publishing AG - Plusbog.dk

Finite Element Analysis on Badminton Racket Design Parameters - Andreas Oechsner - Bog - Springer International Publishing AG - Plusbog.dk

Language and Automata Theory and Applications - - Bog - Springer International Publishing AG - Plusbog.dk

Lorentz Symmetry Breaking—Classical and Quantum Aspects - Albert Petrov - Bog - Springer International Publishing AG - Plusbog.dk

A Course on Hopf Algebras - Rinat Kashaev - Bog - Springer International Publishing AG - Plusbog.dk

Guide to Competitive Programming - Antti Laaksonen - Bog - Springer International Publishing AG - Plusbog.dk

Guide to Competitive Programming - Antti Laaksonen - Bog - Springer International Publishing AG - Plusbog.dk

This textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills. Topics and features:Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithmsCompatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structuresProvides advice for students aiming for the IOI contestSurveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programmingExamines the use of the Python language in competitive programmingDiscusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard libraryExplores how GenAI will impact on the future of the fieldCovers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queriesDescribes a selection of more advanced topics, including square-root algorithms and dynamic programming optimizationFully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike.

DKK 415.00
1

Computer Aided Verification - - Bog - Springer International Publishing AG - Plusbog.dk

Computer Aided Verification - - Bog - Springer International Publishing AG - Plusbog.dk

A Billion SMT Queries a Day.- Program Verification with Constrained Horn Clauses.- Formal Methods for Probabilistic Programs Data-Driven Invariant Learning for Probabilistic Programs.- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs.- Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions.- Abstraction-Renement for Hierarchical Probabilistic Models.- Formal Methods for Neural Networks Shared Certificates for Neural Network Verification.- Example Guided Synthesis of Linear Approximations for Neural Network Verification.- Verifying Neural Networks Against Backdoor Attacks.- Trainify: A CEGAR-Driven Training and Verification Framework for Safe Deep Reinforcement Learning.- Neural Network Robustness as a Verication Property: A Principled Case Study.- Software Verication and Model Checking The Lattice-Theoretic Essence of Property Directed Reachability Analysis.- A‑ne Loop Invariant Generation via Matrix Algebra.- Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes.- Proof-guided Underapproximation Widening for Bounded Model Checking.- SolCMC: Solidity Compiler''s Model Checker.- Sharygina Hyperproperties and Security Software Verication of Hyperproperties Beyond k-Safety.- Abstraction Modulo Stability for Reverse Engineering.- A Modular and Highly Extensible API Fuzzer for SMT Solvers.- Automata and Logic FORQ-based Language Inclusion Formal Testing.- Sound Automation of Magic Wands.- Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition.- Complementing Büchi Automata with Ranker.- Deductive Verication and Decision Procedures Even Faster Conicts and Lazier Reductions for String Solvers.- Local Search For SMT on Linear Integer Arithmetic.- Reasoning about Data Trees using CHCs.- Veried Erasure Correction in Coq with MathComp and VST.- Appel End-to-end Mechanised Proof of an eBPF Virtual Machine for Microcontrollers.- A DSL and Verication Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols.- Machine Learning Specication-Guided Learning of Nash Equilibria with High Social Welfare.- Synthesizing Fair Decision Trees via Iterative Constraint Solving.- SMT-based Translation Validation for Machine Learning Compiler.- Lee Verifying Fairness in Quantum Machine Learning.- MoGym: Using Formal Models for Training and Verifying Decision-making Agents.- Synthesis and Concurrency Synthesis and Analysis of Petri Nets from Causal Specications.- Verifying generalised and structural soundness of workow nets via relaxations.- Capture, Analyze, Diagnose: Realizability Checking of Requirements in FRET.- Information Flow Guided Synthesis.- Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation.

DKK 349.00
1

Computer Aided Verification - - Bog - Springer International Publishing AG - Plusbog.dk

Computer Aided Verification - - Bog - Springer International Publishing AG - Plusbog.dk

A Billion SMT Queries a Day.- Program Verification with Constrained Horn Clauses.- Formal Methods for Probabilistic Programs Data-Driven Invariant Learning for Probabilistic Programs.- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs.- Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions.- Abstraction-Renement for Hierarchical Probabilistic Models.- Formal Methods for Neural Networks Shared Certificates for Neural Network Verification.- Example Guided Synthesis of Linear Approximations for Neural Network Verification.- Verifying Neural Networks Against Backdoor Attacks.- Trainify: A CEGAR-Driven Training and Verification Framework for Safe Deep Reinforcement Learning.- Neural Network Robustness as a Verication Property: A Principled Case Study.- Software Verication and Model Checking The Lattice-Theoretic Essence of Property Directed Reachability Analysis.- A‑ne Loop Invariant Generation via Matrix Algebra.- Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes.- Proof-guided Underapproximation Widening for Bounded Model Checking.- SolCMC: Solidity Compiler''s Model Checker.- Sharygina Hyperproperties and Security Software Verication of Hyperproperties Beyond k-Safety.- Abstraction Modulo Stability for Reverse Engineering.- A Modular and Highly Extensible API Fuzzer for SMT Solvers.- Automata and Logic FORQ-based Language Inclusion Formal Testing.- Sound Automation of Magic Wands.- Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition.- Complementing Büchi Automata with Ranker.- Deductive Verication and Decision Procedures Even Faster Conicts and Lazier Reductions for String Solvers.- Local Search For SMT on Linear Integer Arithmetic.- Reasoning about Data Trees using CHCs.- Veried Erasure Correction in Coq with MathComp and VST.- Appel End-to-end Mechanised Proof of an eBPF Virtual Machine for Microcontrollers.- A DSL and Verication Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols.- Machine Learning Specication-Guided Learning of Nash Equilibria with High Social Welfare.- Synthesizing Fair Decision Trees via Iterative Constraint Solving.- SMT-based Translation Validation for Machine Learning Compiler.- Lee Verifying Fairness in Quantum Machine Learning.- MoGym: Using Formal Models for Training and Verifying Decision-making Agents.- Synthesis and Concurrency Synthesis and Analysis of Petri Nets from Causal Specications.- Verifying generalised and structural soundness of workow nets via relaxations.- Capture, Analyze, Diagnose: Realizability Checking of Requirements in FRET.- Information Flow Guided Synthesis.- Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation.

DKK 349.00
1

Differential Geometry - Loring W. Tu - Bog - Springer International Publishing AG - Plusbog.dk

Differential Geometry - Loring W. Tu - Bog - Springer International Publishing AG - Plusbog.dk

This text presents a graduate-level introduction to differential geometry for mathematics and physics students. The exposition follows the historical development of the concepts of connection and curvature with the goal of explaining the Chern–Weil theory of characteristic classes on a principal bundle. Along the way we encounter some of the high points in the history of differential geometry, for example, Gauss'' Theorema Egregium and the Gauss–Bonnet theorem. Exercises throughout the book test the reader’s understanding of the material and sometimes illustrate extensions of the theory. Initially, the prerequisites for the reader include a passing familiarity with manifolds. After the first chapter, it becomes necessary to understand and manipulate differential forms. A knowledge of de Rham cohomology is required for the last third of the text. Prerequisite material is contained in author''s text An Introduction to Manifolds , and can be learned in one semester. For the benefit of the reader and to establish common notations, Appendix A recalls the basics of manifold theory. Additionally, in an attempt to make the exposition more self-contained, sections on algebraic constructions such as the tensor product and the exterior power are included. Differential geometry, as its name implies, is the study of geometry using differential calculus. It dates back to Newton and Leibniz in the seventeenth century, but it was not until the nineteenth century, with the work of Gauss on surfaces and Riemann on the curvature tensor, that differential geometry flourished and its modern foundation was laid. Over the past one hundred years, differential geometry has proven indispensable to an understanding of the physical world, in Einstein''s general theory of relativity, in the theory of gravitation, in gauge theory, and now in string theory. Differential geometry is also useful in topology, several complex variables, algebraic geometry, complex manifolds, and dynamical systems, among other fields. The field has even found applications to group theory as in Gromov''s work and to probability theory as in Diaconis''s work. It is not too far-fetched to argue that differential geometry should be in every mathematician''s arsenal.

DKK 486.00
1