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.
Algebraic design theory and Hadamard matrices [[electronic resource] ] : ADTHM, Lethbridge, Alberta, Canada, July 2014 / / edited by Charles J. Colbourn
| Algebraic design theory and Hadamard matrices [[electronic resource] ] : ADTHM, Lethbridge, Alberta, Canada, July 2014 / / edited by Charles J. Colbourn |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (261 p.) |
| Disciplina | 511.6 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Combinatorics
Matrix theory Algebra Number theory Information theory Linear and Multilinear Algebras, Matrix Theory Number Theory Information and Communication, Circuits |
| ISBN | 3-319-17729-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On (−1, 1)-matrices of skew type with the maximal determinants and tournaments -- On good matrices and skew Hadamard matrices -- Suitable permutations, binary covering arrays, and Paley matrices -- Divisible design digraphs -- New symmetric (61,16,4) designs obtained from codes -- D-optimal matrices of orders 118, 138, 150, 154 and 174 -- Periodic Golay pairs of length 72 -- Classifying cocyclic Butson Hadamard matrices -- Signed group orthogonal designs and their applications -- On symmetric designs and binary 3-frameproof codes -- An algorithm for constructing Hjelmslev planes -- Mutually unbiased biangular vectors and association schemes -- A simple construction of complex equiangular lines -- Inner product vectors for skew-Hadamard matrices -- Twin bent functions and Clifford algebras -- A Walsh–Fourier approach to the circulant Hadamard matrices -- A note on order and eigenvalue multiplicity of strongly regular graphs -- Trades in complex Hadamard matrices -- The hunt for weighting matrices of small orders -- Menon–Hadamard difference sets obtained from a local field by natural projections -- BIRS Workshop 14w2199 July 11–13, 2014 Problem Solving Session. |
| Record Nr. | UNINA-9910300252403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
| Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIX, 456 p. 335 illus., 47 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer arithmetic and logic units Computer graphics Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures Computer Graphics |
| ISBN | 3-030-25005-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A note on handicap incomplete tournaments -- Computing the k-Crossing Visibility Region of a Point in a Polygon -- An Improved Scheme in the Two Query Adaptive Bitprobe Model -- On Erdős‒Szekeres-type problems for k-convex point sets -- Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set -- Fixed-parameter tractability of (n-k) List Coloring -- Finding Periods in Cartesian Tree Matching -- Parameterized Complexity of Min-Power Asymmetric Connectivity -- Solving Group Interval Scheduling Efficiently -- Call Admission on Trees with Advice (Extended Abstract) -- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs -- Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs -- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs -- Dual Domination -- Reaching 3-Connectivity via Edge-edge Additions -- Cops and robber on some families of oriented graphs -- Disjoint clustering in combinatorial circuits -- The hull number in the convexity of induced paths of order 3 -- Supermagic graphs with many odd degrees -- Incremental algorithm for minimum cut and edge connectivity in Hypergraph -- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications -- Shortest-Path-Preserving Rounding -- Complexity and Algorithms for Semipaired Domination in Graphs -- Computing the Rooted Triplet Distance between Phylogenetic Networks -- Parameterized Algorithms for Graph Burning Problem -- Extension and its price for the connected vertex cover problem -- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number -- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs -- Complexity of fall coloring for restricted graph classes -- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints -- Maximum clique exhaustive search in circulant k-hypergraphs -- Burrows-Wheeler transform of words defined by morphisms -- Stable Noncrossing Matchings -- On the Average Case of MergeInsertion -- Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings -- A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. |
| Record Nr. | UNISA-996466364503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
| Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIX, 456 p. 335 illus., 47 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer arithmetic and logic units Computer graphics Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures Computer Graphics |
| ISBN | 3-030-25005-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A note on handicap incomplete tournaments -- Computing the k-Crossing Visibility Region of a Point in a Polygon -- An Improved Scheme in the Two Query Adaptive Bitprobe Model -- On Erdős‒Szekeres-type problems for k-convex point sets -- Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set -- Fixed-parameter tractability of (n-k) List Coloring -- Finding Periods in Cartesian Tree Matching -- Parameterized Complexity of Min-Power Asymmetric Connectivity -- Solving Group Interval Scheduling Efficiently -- Call Admission on Trees with Advice (Extended Abstract) -- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs -- Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs -- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs -- Dual Domination -- Reaching 3-Connectivity via Edge-edge Additions -- Cops and robber on some families of oriented graphs -- Disjoint clustering in combinatorial circuits -- The hull number in the convexity of induced paths of order 3 -- Supermagic graphs with many odd degrees -- Incremental algorithm for minimum cut and edge connectivity in Hypergraph -- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications -- Shortest-Path-Preserving Rounding -- Complexity and Algorithms for Semipaired Domination in Graphs -- Computing the Rooted Triplet Distance between Phylogenetic Networks -- Parameterized Algorithms for Graph Burning Problem -- Extension and its price for the connected vertex cover problem -- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number -- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs -- Complexity of fall coloring for restricted graph classes -- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints -- Maximum clique exhaustive search in circulant k-hypergraphs -- Burrows-Wheeler transform of words defined by morphisms -- Stable Noncrossing Matchings -- On the Average Case of MergeInsertion -- Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings -- A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. |
| Record Nr. | UNINA-9910349314303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||