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.
Geometry, Structure and Randomness in Combinatorics / / edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini
| Geometry, Structure and Randomness in Combinatorics / / edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2014 |
| Descrizione fisica | 1 online resource (156 p.) |
| Disciplina |
510
516.1 |
| Collana | CRM Series |
| Soggetto topico |
Convex geometry
Discrete geometry Convex and Discrete Geometry |
| ISBN | 88-7642-525-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Imre Bárány: Tensors, colours, octahedral -- Maria Chudnovsky: Cliques and stable sets in undirected graphs -- Mauro Di Nasso: A taste of nonstandard methods in combinatorics of numbers -- Béla Bollobás, Zoltán Füredi, Ida Kantor, G. O. H. Katona and Imre Leader: A coding problem for pairs of subsets -- Jirí Matousek: String graphs and separators -- Jaroslav Nesetril and Patrice Ossona de Mendez: On first-order definable colorings -- Ryan Schwartz and József Solymosi: Combinatorial applications of the subspace theorem -- Peter Hegarty and Dmitry Zhelezov: Can connected commuting graphs of finite groups have arbitrarily large diameter? |
| Record Nr. | UNINA-9910299966003321 |
| Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A Journey Through Discrete Mathematics : A Tribute to Jiří Matoušek / / edited by Martin Loebl, Jaroslav Nešetřil, Robin Thomas
| A Journey Through Discrete Mathematics : A Tribute to Jiří Matoušek / / edited by Martin Loebl, Jaroslav Nešetřil, Robin Thomas |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXXIV, 810 p. 160 illus., 54 illus. in color.) |
| Disciplina | 518.1 |
| Soggetto topico |
Algorithms
Combinatorial analysis Geometry Operations research Management science Algebraic topology Computer science—Mathematics Combinatorics Operations Research, Management Science Algebraic Topology Mathematics of Computing |
| ISBN | 3-319-44479-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simplex Range Searching and Its Variants: A Review: Pankaj K. Agarwal.- Fair Representation by Independent Sets: Ron Aharoni, Noga Alon, Eli Berger, Maria Chudnovsky, Dani Kotlar, Martin Loebl, and Ran Ziv.- Computing Heegaard Genus Is NP-Hard: David Bachman, Ryan Derby-Talbot, and Eric Sedgwick.- Approximation-Friendly Discrepancy Rounding: Nikhil Bansal and Viswanath Nagarajan.- A Tverberg Type Theorem for Matroids: Imre Barany, Gil Kalai, Roy Meshulam.- Gershgorin Disks for Multiple Eigenvalues of Non-Negative Matrices: Imre Bárány and József Solymosi.- Computing the Partition Function of a Polynomial on the Boolean Cube: Alexander Barvinok -- Siegel's Lemma Is Sharp: József Beck.- On Codimension One Embedding of Simplicial Complexes: Anders Björner and Afshin Goodarzi -- Around Brouwer's Fixed Point Theorem: Anders Björner, Jiri Matousek, and Günter M. Ziegler.- Beyond the Borsuk-Ulam Theorem: The Topological Tverberg Story: Pavle V. M. Blagojevic and Günter M. Ziegler.- One-Sided Epsilon-Approximants: Boris Bukh and Gabriel Nivasch.- A Note on Induced Ramsey Numbers: David Conlon, Domingos Dellamonica Jr., Steven La Fleur, Vojtech Rödl, and Mathias Schacht.- ARRIVAL: A Zero-Player Graph Game in NP \ coNP: Jerome Dohrau, Bernd Gärtner, Manuel Kohler, Jiri Matousek, and Emo Welzl.- Constant-Factor Approximation for TSP with Disks: Adrian Dumitrescu, and Csaba D. Toth.- Transport-Entropy Inequalities and Curvature in Discrete-State Markov Chains: Ronen Eldan, James R. Lee, and Joseph Lehec.- Bounding Helly Numbers Via Betti Numbers: Xavier Goaoc, Pavel Patak, Zuzana Patakova, Martin Tancer, and Uli Wagner.- Ruled Surface Theory and Incidence Geometry: Larry Guth.- Approximating the k-Level in Three-Dimensional Plane Arrangements: Sariel Har-Peled, Haim Kaplan, and Micha Sharir.- Schrijver Graphs and Projective Quadrangulations: Tomas Kaiser and Matej Stehlik.- Near-Optimal Lower Bounds for nets for Halfspaces and Low Complexity Set Systems: Andrey Kupavskii, Nabil H. Mustafa, and Janos Pach.- Random Simplicial Complexes - Around the Phase Transition: Nathan Linial and Yuval Peled.- Nullspace Embeddings for Outerplanar Graphs: Laszlo Lovasz and Alexander Schrijver.- Homology of Spaces of Directed Paths in Euclidean Pattern Spaces: Roy Meshulam and Martin Raussen.- Sperner's Colorings and Optimal Partitioning of the Simplex: Maryam Mirzakhani and Jan Vondrak.- Teaching and Compressing for Low VC-Dimension: Shay Moran, Amir Shpilka, Avi Wigderson, and Amir Yehudayo.- Restricted Invertibility Revisited: Assaf Naor and Pierre Youssef.- Rational Polygons: Odd Compression Ratio and Odd Plane Coverings: Rom Pinchasi and Yuri Rabinovich.- First Order Probabilities for Galton{Watson Trees: Moumanti Podder and Joel Spencer.- Crossing-Free Perfect Matchings in Wheel Point Sets: Andres J. Ruiz-Vargas and Emo Welzl.- Network Essence: Page Rank Completion and Centrality-Conforming Markov Chains: Shang-Hua Teng.- Anti-Concentration Inequalities for Polynomials: Van Vu. |
| Record Nr. | UNINA-9910254287203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical and Engineering Methods in Computer Science [[electronic resource] ] : 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers / / edited by Antonin Kucera, Thomas A. Henzinger, Jaroslav Nešetřil, Tomas Vojnar, David Antos
| Mathematical and Engineering Methods in Computer Science [[electronic resource] ] : 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers / / edited by Antonin Kucera, Thomas A. Henzinger, Jaroslav Nešetřil, Tomas Vojnar, David Antos |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 213 p. 32 illus.) |
| Disciplina | 005.1 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer communication systems Algorithms Management information systems Computer science Economic theory Software Engineering Computer Communication Networks Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Economic Theory/Quantitative Economics/Mathematical Methods |
| ISBN | 3-642-36044-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | BDD-Based Software Model Checking with CPAchecker -- Security for Cyber-Physical Systems -- Quantum Secret Sharing with Graph States -- Testing Embedded Memories: A Survey -- Quicksort and Large Deviations -- Recent Results on Howard’s Algorithm -- Advantage of Quantum Strategies in Random Symmetric XOR Games -- Verification of Liveness Properties on Closed Timed-Arc Petri Nets -- Fast Algorithm for Rank-Width -- Determinacy in Stochastic Games with Unbounded Payoff Functions -- Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games -- Controllable-Choice Message Sequence Graphs -- A Better Way towards Key Establishment and Authentication in Wireless Sensor Networks -- Parameterized Algorithms for Stochastic Steiner Tree Problems -- Action Investment Energy Games -- Ciphertext-Only Attack on Gentry-Halevi Implementation of Somewhat Homomorphic Scheme -- Grover’s Algorithm with Errors -- On WQO Property for Different Quasi Orderings of the Set of Permutations -- Towards User-Aware Multi-touch Interaction Layer for Group Collaborative Systems. |
| Record Nr. | UNISA-996465998903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013 / / edited by Jaroslav Nešetřil, Marco Pellegrini
| The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013 / / edited by Jaroslav Nešetřil, Marco Pellegrini |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2013 |
| Descrizione fisica | 1 online resource (612 p.) |
| Disciplina |
511.5
511.6 |
| Collana | CRM Series |
| Soggetto topico |
Combinatorial analysis
Graph theory Combinatorics Graph Theory |
| ISBN | 88-7642-475-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""Cover""; ""Title Page""; ""Copyright Page""; ""Table of Contents""; ""Foreword""; ""Invited Speakers""; ""ErdÅ?s problems""; ""A problem of ErdÅ?s and Sós on 3-graphs""; ""1 Introduction""; ""2 Sketch of the proof""; ""References""; ""An analogue of the ErdÅ?s-Ko-Rado theorem for multisets""; ""1 Introduction""; ""1.1 Definitions, notation""; ""1.2 History""; ""1.3 Conjectures""; ""1.4 Results""; ""2 Concluding remarks""; ""References""; ""Polynomial gap extensions of the ErdÅ?sâ€?Pósa theorem""; ""1 Introduction""; ""2 Excluding packings of planar graphs""; ""References""
""The ErdÅ?s-Pósa property for long circuits""""1 Introduction""; ""2 Proof of Theorem 1.1""; ""References""; ""Hypergraphs""; ""A hypergraph Turán theorem via Lagrangians of intersecting families""; ""1 Introduction""; ""2 Lagrangians of intersecting 3-graphs""; ""3 An application to a hypergraph Turán problem""; ""3.1 Stability""; ""4 Concluding remarks and open problems""; ""References""; ""Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs""; ""1 Introduction""; ""2 Overview of the proof of Theorem 1.1""; ""Almost perfect matchings""; ""Absorbing sets"" ""The auxiliary graph G""""References""; ""Fractional and integer matchings in uniform hypergraphs""; ""Large matchings in hypergraphs with many edges""; ""Large matchings in hypergraphs with large degrees""; ""Large fractional matchings""; ""References""; ""Cubic graphs""; ""On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings""; ""1 Introduction""; ""2 Aninfinite family of snarks with excessive index 5""; ""3 Shortest cycle cover""; ""4 Open problems""; ""References""; ""Relating ordinary and total domination in cubic graphs of large girth""; ""References"" ""Snarks with large oddness and small number of vertices""""1 Introduction""; ""2 Oddness and resistance ratios""; ""3 Lower bounds on oddness ratio""; ""4 Constructions""; ""References""; ""Non-trivial snarks with given circular chromatic index""; ""1 Introduction""; ""2 Balanced schemes""; ""References""; ""Graphs""; ""The graph formulation of the union-closed sets conjecture""; ""References""; ""The union-closed sets conjecture almost holds for almost all random bipartite graphs""; ""1 Introduction""; ""2 Discussion of averaging""; ""3 Sketch of the proof of Theorem 2.2""; ""References"" ""The robust component structure of dense regular graphs""""1 Introduction""; ""2 Two applications to longest cycles in regular graphs""; ""3 Sketch of the proof of Theorems 1.2 and 2.2""; ""3.1 Sketch proof of Theorem 1.2""; ""3.2 Sketch proof of Theorem 2.2""; ""References""; ""The (â??, D) and (â??, N) problemsin double-step digraphs with unilateral diameter""; ""1 Preliminaries""; ""1.1 Double-step digraphs""; ""1.2 Unilateral distance""; ""2 The unilateral diameter of double-step digraphs with step a=1"" ""3 The(â??, D*) and (â??,N)* problems for double-step digraphs with unilateral diameter"" |
| Record Nr. | UNINA-9910438136803321 |
| Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||