Tags
Language
Tags

Diskrete Mathematik

Posted By: AvaxGenius
Diskrete Mathematik

Diskrete Mathematik by Martin Aigner
Deutsch | PDF | 2006 | 355 Pages | ISBN : 3834800848 | 4 MB

Das Standardwerk über Diskrete Mathematik in deutscher Sprache. Nachdem die 5. Auflage vollständig neu bearbeitet wurde und das Buch im neuen Layout erschien, wurden in der 6. Auflage einige Druckfehler korrigiert.

The Complexity Theory Companion

Posted By: AvaxGenius
The Complexity Theory Companion

The Complexity Theory Companion by Lane A. Hemaspaandra, Mitsunori Ogihara
English | PDF | 2002 | 375 Pages | ISBN : 3540674195 | 35.8 MB

The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.

New Trends in Mathematical Programming: Homage to Steven Vajda

Posted By: AvaxGenius
New Trends in Mathematical Programming: Homage to Steven Vajda

New Trends in Mathematical Programming: Homage to Steven Vajda by Franco Giannessi, Sándor Komlósi, Tamás Rapcsák
English | PDF | 1998 | 315 Pages | ISBN : 0792350367 | 25.3 MB

Though the volume covers 22 papers by 36 authors from 12 countries, the history in the background is bound to Hungary where, in 1973 Andras Pn§kopa started to lay the foundation of a scientific forum, which can be a regular meeting spot for experts of the world in the field. Since then, there has been a constant interest in that forum.

Algorithms and Order

Posted By: AvaxGenius
Algorithms and Order

Algorithms and Order by Ivan Rival
English | PDF | 1989 | 491 Pages | ISBN : 0792300076 | 38.8 MB

This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets.

Applications of Zero-Suppressed Decision Diagrams

Posted By: IrGens
Applications of Zero-Suppressed Decision Diagrams

Applications of Zero-Suppressed Decision Diagrams (Synthesis Lectures on Digital Circuits and Systems) by Jon T. Butler, Tsutomu Sasao
English | December 1, 2014 | ISBN: 1627056491 | True PDF | 124 pages | 2 MB

The Strange Logic of Random Graphs

Posted By: AvaxGenius
The Strange Logic of Random Graphs

The Strange Logic of Random Graphs by Joel Spencer
English | PDF | 2001 | 167 Pages | ISBN : 3540416544 | 14.6 MB

The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zero-one law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures.

Graph Transformation

Posted By: AvaxGenius
Graph Transformation

Graph Transformation: 15th International Conference, ICGT 2022, Held as Part of STAF 2022, Nantes, France, July 7–8, 2022, Proceedings by Nicolas Behr
English | PDF | 2022 | 216 Pages | ISBN : 3031098420 | 10.6 MB

This book constitutes the refereed proceedings of the 15th International Conference on Graph Transformation, ICGT 2022, which took place Nantes, France in July 2022.
The 10 full papers and 1 tool paper presented in this book were carefully reviewed and selected from 19 submissions. The conference focuses on describing new unpublished contributions in the theory and applications of graph transformation as well as tool presentation papers that demonstrate main new features and functionalities of graph-based tools.

SOFSEM 2020: Theory and Practice of Computer Science (Repost)

Posted By: AvaxGenius
SOFSEM 2020: Theory and Practice of Computer Science (Repost)

SOFSEM 2020: Theory and Practice of Computer Science: 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020, Proceedings by Alexander Chatzigeorgiou
English | PDF | 2020 | 725 Pages | ISBN : 3030389189 | 35.5 MB

The 40 full papers presented together with 17 short papers and 3 invited papers were carefully reviewed and selected from 125 submissions. They presented new research results in the theory and practice of computer science in the each sub-area of SOFSEM 2020: foundations of computer science, foundations of data science and engineering, foundations of software engineering, and foundations of algorithmic computational biology.

Algorithms in Invariant Theory, 2nd Edition

Posted By: AvaxGenius
Algorithms in Invariant Theory, 2nd Edition

Algorithms in Invariant Theory, 2nd Edition by Bernd Sturmfels
English | PDF(True) | 2008 | 202 Pages | ISBN : 3211774165 | 1.7 MB

This book is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to research ideas, hints for applications, outlines and details of algorithms, examples and problems.

Algorithms in Invariant Theory

Posted By: AvaxGenius
Algorithms in Invariant Theory

Algorithms in Invariant Theory by Bernd Sturmfels
English | PDF | 1993 | 202 Pages | ISBN : 3211824456 | 18.3 MB

This textbook for invariant theory and research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner-based method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions. Students should find the book useful as an introduction to this classical and new area of mathematics. Researchers in mathematics, symbolic computation and computer science should get access to a wealth of research ideas, hints for applications, outlines and details of algorithms, worked-out examples and research problems.

Cohesive Subgraph Search Over Large Heterogeneous Information Networks

Posted By: AvaxGenius
Cohesive Subgraph Search Over Large Heterogeneous Information Networks

Cohesive Subgraph Search Over Large Heterogeneous Information Networks by Yixiang Fang
English | EPUB | 2022 | 86 Pages | ISBN : 3030975673 | 2.9 MB

This SpringerBrief provides the first systematic review of the existing works of cohesive subgraph search (CSS) over large heterogeneous information networks (HINs). It also covers the research breakthroughs of this area, including models, algorithms and comparison studies in recent years. This SpringerBrief offers a list of promising future research directions of performing CSS over large HINs.

Foundations of Generic Optimization Volume 1: A Combinatorial Approach to Epistasis

Posted By: AvaxGenius
Foundations of Generic Optimization Volume 1: A Combinatorial Approach to Epistasis

Foundations of Generic Optimization Volume 1: A Combinatorial Approach to Epistasis by M. Iglesias
English | PDF | 2005 | 302 Pages | ISBN : 1402036663 | 6 MB

The success of a genetic algorithm when applied to an optimization problem depends upon several features present or absent in the problem to be solved, including the quality of the encoding of data, the geometric structure of the search space, deception or epistasis. This book deals essentially with the latter notion, presenting for the first time a complete state-of-the-art research on this notion, in a structured completely self-contained and methodical way.

Modelli Dinamici Discreti

Posted By: AvaxGenius
Modelli Dinamici Discreti

Modelli Dinamici Discreti by Ernesto Salinelli
Italiano | PDF | 2014 | 407 Pages | ISBN : 8847055032 | 4.1 MB

Questo volume fornisce una introduzione all’analisi dei sistemi dinamici discreti. La materia è presentata mediante un approccio unitario tra il punto di vista modellistico e quello di varie discipline che sviluppano metodi di analisi e tecniche risolutive: Analisi Matematica, Algebra Lineare, Analisi Numerica, Teoria dei Sistemi, Calcolo delle Probabilità.

Teoria degli Automi Finiti (Repost)

Posted By: AvaxGenius
Teoria degli Automi Finiti (Repost)

Teoria degli Automi Finiti by Aldo Luca
Italiano | PDF | 2013 | 328 Pages | ISBN : 8847054737 | 1.9 MB

Gli Automi sono modelli matematici di macchine digitali di grande interesse sia dal punto di vista teorico che applicativo. La teoria degli Automi Finiti costituisce una delle parti fondamentali dell’Informatica Teorica. Questo volume fornisce, per la prima volta, nel panorama didattico italiano una trattazione matematicamente rigorosa della teoria degli Automi Finiti e delle macchine sequenziali generalizzate nell’ambito della teoria algebrica dei semigruppi.

Ottimizzazione Combinatoria: Teoria e Algoritmi

Posted By: AvaxGenius
Ottimizzazione Combinatoria: Teoria e Algoritmi

Ottimizzazione Combinatoria: Teoria e Algoritmi by Bernhard Korte
Italiano | PDF | 2011 | 670 Pages | ISBN : 8847015227 | 4.2 MB

Questo libro di testo di ottimizzazione combinatoria pone in particolare risalto i risultati teorici e gli algoritmi che, al contrario delle euristiche, hanno una garanzia di avere buone prestazioni. Comprende una vasta scelta di argomenti e nasce come riferimento di diversi corsi di ottimizzazione combinatoria sia di base che di livello avanzato. Il libro contiene dimostrazioni complete (ma concise) anche di molti risultati avanzati, alcuni dei quali non sono mai apparsi prima in un libro. Vengono anche trattati molti dei temi di ricerca più attuali e sono riportati molti riferimenti alla letteratura. Quindi questo libro, traduzione della quarta edizione in lingua originale, rappresenta lo stato dell'arte dell'ottimizzazione combinatoria.