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.
A course in computational algebraic number theory / Henri Cohen
| A course in computational algebraic number theory / Henri Cohen |
| Autore | Cohen, Henri |
| Pubbl/distr/stampa | Berlin ; Heidelberg, : Springer-Verlag, 1993 |
| Descrizione fisica | xxi, 534 p. ; 24 cm |
| Soggetto topico |
11-XX - Number theory [MSC 2020]
11Rxx - Algebraic number theory: global fields [MSC 2020] 11Y05 - Factorization [MSC 2020] 11Y11 - Primality [MSC 2020] 11Y16 - Number-theoretic algorithms; complexity [MSC 2020] 11Y40 - Algebraic number theory computations [MSC 2020] |
| Soggetto non controllato |
Algebra
Algorithm Analysis and Problem Complexity Algorithms Computer algebra Computers Factorisation Number theory Primality Symbolic Computation |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00290387 |
Cohen, Henri
|
||
| Berlin ; Heidelberg, : Springer-Verlag, 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
A course in computational algebraic number theory / Henri Cohen
| A course in computational algebraic number theory / Henri Cohen |
| Autore | Cohen, Henri |
| Pubbl/distr/stampa | Berlin ; Heidelberg, : Springer-Verlag, 1993 |
| Descrizione fisica | XXI, 534 p. ; 24 cm |
| Soggetto topico |
11-XX - Number theory [MSC 2020]
11Rxx - Algebraic number theory: global fields [MSC 2020] 11Y05 - Factorization [MSC 2020] 11Y11 - Primality [MSC 2020] 11Y16 - Number-theoretic algorithms; complexity [MSC 2020] 11Y40 - Algebraic number theory computations [MSC 2020] |
| Soggetto non controllato |
Algebra
Algorithm Analysis and Problem Complexity Algorithms Computer algebra Computers Factorisation Number theory Primality Symbolic Computation |
| ISBN | 978-35-405-5640-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00029432 |
|
Cohen, Henri
|
||
| Berlin ; Heidelberg, : Springer-Verlag, 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Analysis and enumeration : algorithms for biological graphs / Andrea Marino
| Analysis and enumeration : algorithms for biological graphs / Andrea Marino |
| Autore | Marino, Andrea |
| Pubbl/distr/stampa | [Amsterdam], : Atlantis, 2015 |
| Descrizione fisica | XVII, 151 p. : ill. ; 24 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C38 - Paths and cycles [MSC 2020] 05C90 - Applications of graph theory [MSC 2020] 92-XX - Biology and other natural sciences [MSC 2020] 92C42 - Systems biology, networks [MSC 2020] |
| Soggetto non controllato |
Algorithm Analysis and Problem Complexity
Bubbles Cycles and Paths Enumeration Algorithms Graphs Stories |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumerating stories, enumerating paths or cycles, and enumerating bubbles. Notice that the corresponding computational problems we define are of more general interest and our results hold in the case of arbitrary graphs. Enumerating all the most and less central vertices in a network according to their eccentricity is an example of an enumeration problem whose solutions are polynomial and can be listed in polynomial time, very often in linear or almost linear time in practice. Enumerating stories, i.e. all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions, that can be solved by using a non trivial brute-force approach. Given a metabolic network, each individual story should explain how some interesting metabolites are derived from some others through a chain of reactions, by keeping all alternative pathways between sources and targets. Enumerating cycles or paths in an undirected graph, such as a protein-protein interaction undirected network, is an example of an enumeration problem in which all the solutions can be listed through an optimal algorithm, i.e. the time required to list all the solutions is dominated by the time to read the graph plus the time required to print all of them. By extending this result to directed graphs, it would be possible to deal more efficiently with feedback loops and signed paths analysis in signed or interaction directed graphs, such as gene regulatory networks. Finally, enumerating mouths or bubbles with a source s in a directed graph, that is enumerating all the two vertex-disjoint directed paths between the source s and all the possible targets, is an example of an enumeration problem in which all the solutions can be listed through a linear delay algorithm, meaning that the delay between any two consecutive solutions is linear, by turning the problem into a constrained cycle enumeration problem. Such patterns, in a de Bruijn graph representation of the reads obtained by sequencing, are related to polymorphisms in DNA- or RNA-seq data. |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00114043 |
|
Marino, Andrea
|
||
| [Amsterdam], : Atlantis, 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Arbres pour l’algorithmique / Brigitte Chauvin, Julien Clément, Danièle Gardy
| Arbres pour l’algorithmique / Brigitte Chauvin, Julien Clément, Danièle Gardy |
| Autore | Chauvin, Brigitte |
| Pubbl/distr/stampa | Cham, : Springer, 2018 |
| Descrizione fisica | 1 testo elettronico (XXXI, 513 p. : ill.) |
| Altri autori (Persone) |
Clément, Julien
Gardy, Danièle |
| Soggetto topico |
68-XX - Computer science [MSC 2020]
68Pxx - Theory of data [MSC 2020] |
| Soggetto non controllato |
Algorithm Analysis and Problem Complexity
Analyse en Moyenne et en Distribution Arbres Binaires de Recherche Arbres Digitaux Arbres Planaires Arbres Quadrants Combinatorics Complexité en moyenne et en distribution Data structures Marches aléatoires branchantes Processus de Galton-Watson Tas Urnes de Pólya |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00124578 |
|
Chauvin, Brigitte
|
||
| Cham, : Springer, 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Classes of directed graphs / Jørgen Bang-Jensen, Gregory Gutin editors
| Classes of directed graphs / Jørgen Bang-Jensen, Gregory Gutin editors |
| Pubbl/distr/stampa | Cham, : Springer, 2018 |
| Descrizione fisica | 1 testo elettronico (XXII, 636 p. : ill.) |
| Soggetto topico |
05Cxx - Graph theory [MSC 2020]
68Wxx - Algorithms in computer science [MSC 2020] 90C27 - Combinatorial optimization [MSC 2020] 94A60 - Cryptography [MSC 2020] 94C15 - Applications of graph theory to circuits and networks [MSC 2020] |
| Soggetto non controllato |
Acyclic Digraphs
Algorithm Analysis and Problem Complexity Directed graphs Directed graphs classes Directed width parameters Disjoint paths Euler digraphs Feedback sets Graph branchings Graph connectivity Graph products Hamiltonian cycles Hamiltonian paths Orientations of graphs Planar digraphs Tournaments generalizations |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00124591 |
| Cham, : Springer, 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Elements of Finite Model Theory / Leonid Libkin
| Elements of Finite Model Theory / Leonid Libkin |
| Autore | Libkin, Leonid |
| Pubbl/distr/stampa | Berlin ; Heidelberg, : Springer, 2004 |
| Descrizione fisica | xiv, 318 p. : ill. ; 24 cm |
| Soggetto topico |
03-XX - Mathematical logic and foundations [MSC 2020]
03C13 - Model theory of finite structures [MSC 2020] 68-XX - Computer science [MSC 2020] 68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.) [MSC 2020] 68Q19 - Descriptive complexity and finite models [MSC 2020] |
| Soggetto non controllato |
Algorithm Analysis and Problem Complexity
Automata Complexity Complexity theory Formal language Logic Model theory Variable |
| ISBN | 978-35-402-1202-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00283787 |
|
Libkin, Leonid
|
||
| Berlin ; Heidelberg, : Springer, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Fast Radial Basis Functions for Engineering Applications / Marco Evangelos Biancolini
| Fast Radial Basis Functions for Engineering Applications / Marco Evangelos Biancolini |
| Autore | Biancolini, Marco E. |
| Pubbl/distr/stampa | Cham, : Springer, 2017 |
| Descrizione fisica | xiv, 358 p. : ill. ; 24 cm |
| Soggetto topico |
00A69 - General applied mathematics [MSC 2020]
41A30 - Approximation by other special function classes [MSC 2020] 65-XX - Numerical analysis [MSC 2020] 65Dxx - Numerical approximation and computational geometry (primarily algorithms) [MSC 2020] 65M50 - Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs [MSC 2020] 74L15 - Biomechanical solid mechanics [MSC 200] 74Sxx - Numerical and other methods in solid mechanics [MSC 2020] |
| Soggetto non controllato |
Advanced Numerical Methods
Algorithm Analysis and Problem Complexity Engineering Applications High Performance Computing Interpolar and Regression Radial basis functions |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00124374 |
|
Biancolini, Marco E.
|
||
| Cham, : Springer, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Finite model theory / Heinz-Dieter Ebbinghaus, Jörg Flum
| Finite model theory / Heinz-Dieter Ebbinghaus, Jörg Flum |
| Autore | Ebbinghaus, Heinz-Dieter |
| Edizione | [2. rev. and enl. ed. 1999] |
| Pubbl/distr/stampa | Berlin ; Heidelberg, : Springer, 2006 |
| Descrizione fisica | xi, 360 p. : ill. ; 24 cm |
| Soggetto topico |
03C13 - Model theory of finite structures [MSC 2020]
03C80 - Logic with extra quantifiers and operators [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 68P15 - Database theory [MSC 2020] |
| Soggetto non controllato |
Algorithm Analysis and Problem Complexity
Automata Boolean satisfiability problem Complexity Complexity theory Finite model theory Fixed-point logics Logic Model theory Optimization Theory of complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00299765 |
|
Ebbinghaus, Heinz-Dieter
|
||
| Berlin ; Heidelberg, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Finite model theory / Heinz-Dieter Ebbinghaus, Jörg Flum
| Finite model theory / Heinz-Dieter Ebbinghaus, Jörg Flum |
| Autore | Ebbinghaus, Heinz-Dieter |
| Pubbl/distr/stampa | Berlin, : Springer, 1995 |
| Descrizione fisica | xv, 327 p. : ill. ; 25 cm |
| Soggetto topico |
03C13 - Model theory of finite structures [MSC 2020]
03C80 - Logic with extra quantifiers and operators [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 68P15 - Database theory [MSC 2020] |
| Soggetto non controllato |
Algorithm Analysis and Problem Complexity
Automata Boolean satisfiability problem Complexity Complexity theory Finite model theory Fixed-point logics Logic Model theory Optimization Theory of complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00294069 |
|
Ebbinghaus, Heinz-Dieter
|
||
| Berlin, : Springer, 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Finite model theory / Heinz-Dieter Ebbinghaus, Jörg Flum
| Finite model theory / Heinz-Dieter Ebbinghaus, Jörg Flum |
| Autore | Ebbinghaus, Heinz-Dieter |
| Pubbl/distr/stampa | Berlin, : Springer, 1995 |
| Descrizione fisica | xv, 327 p. : ill. ; 25 cm |
| Altri autori (Persone) | Flum, Jörg |
| Soggetto topico |
03C13 - Model theory of finite structures [MSC 2020]
03C80 - Logic with extra quantifiers and operators [MSC 2020] 03D15 - Complexity of computation [MSC 2020] 68P15 - Database theory [MSC 2020] |
| Soggetto non controllato |
Algorithm Analysis and Problem Complexity
Automata Boolean satisfiability problem Complexity Complexity theory Finite model theory Fixed-point logics Logic Model theory Optimization Theory of complexity |
| ISBN |
35-406-0149-X
978-35-406-0149-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00055754 |
|
Ebbinghaus, Heinz-Dieter
|
||
| Berlin, : Springer, 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
