Výsledky vyhľadávania - Mathematics of computing Discrete mathematics Combinatorics Combinatorial algorithms

NEW FAMILIES OF SPECIAL NUMBERS FOR COMPUTING NEGATIVE ORDER EULER NUMBERS AND RELATED NUMBERS AND POLYNOMIALS

Autori: Simsek, Yilmaz

Zdroj: Applicable Analysis and Discrete Mathematics, 2018 Apr 01. 12(1), 1-35.

Prístupová URL adresa: https://www.jstor.org/stable/90020602

Cost-sharing in Parking Games

Autori: Jennifer Elder Pamela E. Harris Jan Kretschmann a ďalší

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:3, Iss Combinatorics (2024)

Predmety: mathematics - combinatorics, computer science - discrete mathematics, computer science - computer science and game theory, 05a05, 91a12, 91a46, Mathematics, QA1-939

Popis súboru: electronic resource

Relation: http://dmtcs.episciences.org/13113/pdf; https://doaj.org/toc/1365-8050

Prístupová URL adresa: https://doaj.org/article/a3dfb287411f4e948a35385c399f4255

On the Length of Monotone Paths in Polyhedra

Autori: Blanchard, Moïse De Loera, Jesús A Louveaux, Quentin

Zdroj: SIAM Journal on Discrete Mathematics. 35(3)

Predmety: Theory Of Computation, Applied Mathematics, Information and Computing Sciences, Pure Mathematics, Mathematical Sciences, simplex method, diameter and height of polytopes, pivot rules, monotone paths, graphs of polyhedra, polyhedral combinatorics, Computation Theory and Mathematics, Computation Theory & Mathematics, Theory of computation, Applied mathematics, Pure mathematics

Prístupová URL adresa: https://escholarship.org/uc/item/6mk1d53m

Graphs for Pattern Recognition : Infeasible Systems of Linear Inequalities

Autori: Damir Gainanov

Typ zdroja: eBook.

Predmet: Inequalities (Mathematics), Graph theory

Kategórie: MATHEMATICS / Combinatorics, COMPUTERS / Image Processing, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Geometry / General, MATHEMATICS / Optimization

Further enumeration results concerning a recent equivalence of restricted inversion sequences

Autori: Toufik Mansour Mark Shattuck

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Combinatorics (2022)

Predmety: 65q30 pattern avoidance, combinatorial statistic, july 22, 2021. 2010 mathematics subject classification. 05a15, 05a05, 65q20, kernel method, inversion sequence, [math.math-co]mathematics [math]/combinatorics [math.co], [math.math-mp]mathematics [math]/mathematical physics [math-ph], Mathematics, QA1-939

Popis súboru: electronic resource

Relation: https://dmtcs.episciences.org/8330/pdf; https://doaj.org/toc/1365-8050

Prístupová URL adresa: https://doaj.org/article/054cb31060ae407b9a261c1de8e11287

Combinatorial Point Configurations and Polytopes

Autori: Sergiy Yakovlev Oksana Pichugina Liudmyla Koliechkina

Typ zdroja: eBook.

Predmet: Combinatorial analysis

Kategórie: MATHEMATICS / Discrete Mathematics

Markov Bases: Their Complexity and Applications to Network Analysis

Autori: Almendra Hernandez, Felix

Predmety: Mathematics, Statistics, Applied mathematics

Popis súboru: application/pdf

Prístupová URL adresa: https://escholarship.org/uc/item/2pq6k753
https://escholarship.org/content/qt2pq6k753/qt2pq6k753.pdf

Computing Minimal Generating Sets of Invariant Rings of Permutation Groups with SAGBI-Gröbner Basis

Autori: Nicolas Thiéry

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AA,..., Iss Proceedings (2001)

Predmety: permutation group, invariant theory, discrete mathematics, minimal generating set, mupad, permuvar, sagbi-gröbner basis, hironaka decomposition, [info] computer science [cs], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-cg] computer science [cs]/computational geometry [cs.cg], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [info.info-hc] computer science [cs]/human-computer interaction [cs.hc], Mathematics, QA1-939

Popis súboru: electronic resource

Relation: https://dmtcs.episciences.org/2285/pdf; https://doaj.org/toc/1365-8050

Prístupová URL adresa: https://doaj.org/article/81f867ed998843b18d5ae9817682d81d

Mathematization Through Application and Common Sense: Motivating Intellectual Activities of Schoolchildren with Digital Tools.

Autori: Abramovich, Sergei Malyutin, Egor Pozdniakov, Sergei

Zdroj: Digital; Sep2025, Vol. 5 Issue 3, p41, 19p

Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems

Autori: Azad, Ariful Selvitopi, Oguz Hussain, Md Taufique a ďalší

Témy: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Discrete Mathematics, Computer Science - Performance, Mathematics - Combinatorics, text

URL: http://arxiv.org/abs/2106.14402

Approximations of Points: Combinatorics and Algorithms

Autori: Mustafa, Nabil

Predmety: [INFO:INFO_CG] Computer Science/Computational Geometry, [INFO:INFO_CG] Informatique/Géométrie algorithmique, [INFO:INFO_DS] Computer Science/Data Structures and Algorithms, [INFO:INFO_DS] Informatique/Algorithme et structure de données, [MATH:MATH_ST] Mathematics/Statistics, [MATH:MATH_ST] Mathématiques/Statistiques, [STAT:TH] Statistics/Statistics Theory, [STAT:TH] Statistiques/Théorie, [MATH:MATH_CO] Mathematics/Combinatorics, [MATH:MATH_CO] Mathématiques/Combinatoire, geometric algorithms, combinatorics, discrete mathematics, computational geometry, statistics, approximation algorithms

Dostupnosť: http://tel.archives-ouvertes.fr/tel-01062825
http://tel.archives-ouvertes.fr/docs/01/06/28/25/PDF/thesis.pdf

Computation in Multicriteria Matroid Optimization

Autori: Jesús A. De Loera David C. Haws Jon Lee a ďalší

Prispievatelia: Jesús A. De Loera David C. Haws Jon Lee a ďalší

Zdroj: http://www.math.ucdavis.edu/~deloera/RECENT_WORK/Fyn.pdf.

Predmety: Categories and Subject Descriptors, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial Algorithms, G.2.2 [Mathematics of Computing, Discrete Mathematics—Graph Theory General Terms, Algorithms, Experimentation, Performance Additional Key Words and Phrases, Matroids, Matroid Optimization, Multicriteria Optimization, Local Search, Tabu Search, Non-linear combinatorial optimization, Multiobjective Optimization

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.1553; http://www.math.ucdavis.edu/~deloera/RECENT_WORK/Fyn.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.1553
http://www.math.ucdavis.edu/~deloera/RECENT_WORK/Fyn.pdf

Approximation algorithms for restricted cycle covers based on cycle decompositions

Autori: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/cs/0604020v2.pdf.

Predmety: Combinatorial Optimisation, Graph Algorithms, Approximation Algorithms, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615; http://arxiv.org/pdf/cs/0604020v2.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615
http://arxiv.org/pdf/cs/0604020v2.pdf

Approximability of Minimum-weight Cycle Covers

Autori: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/cs/0609103v1.pdf.

Predmety: Combinatorial Optimization, Graph Algorithms, Approximation Algorithms, Inapproximability, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and circuit problems

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3691; http://arxiv.org/pdf/cs/0609103v1.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3691
http://arxiv.org/pdf/cs/0609103v1.pdf

Monodromy and K-theory of Schubert curves via generalized jeu de taquin

Autori: Maria Monks Gillespie Jake Levinson

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)

Predmety: [math.math-co]mathematics [math]/combinatorics [math.co], Mathematics, QA1-939

Popis súboru: electronic resource

Relation: https://dmtcs.episciences.org/6381/pdf; https://doaj.org/toc/1365-8050

Prístupová URL adresa: https://doaj.org/article/2522fa065fbc4fafb5182569494d2667

Minimum-weight Cycle Covers and Their Approximability

Autori: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/cs/0609103v2.pdf.

Predmety: Combinatorial Optimization, Graph Algorithms, Approximation Algorithms, Inapproximability, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and circuit problems

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4448; http://arxiv.org/pdf/cs/0609103v2.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4448
http://arxiv.org/pdf/cs/0609103v2.pdf

Shift gray codes

Autori: Williams, Aaron Michael

Thesis Advisors: Ruskey, Frank, Myrvold, W. J.

Predmety: shorthand universal cycles, combinatorial generation, minimal-change order, loopless algorithm, efficient algorithm, combinations, multiset permutations, balanced parentheses, Dyck words, Catalan paths, Schroder paths, Motzkin words, linear-extensions, posets, connected unit interval graphs, inversions, binary trees, k-ary trees, ordered trees with fixed branching sequence, Lyndon words, pre-necklaces, theoretical computer science, discrete mathematics, combinatorics, brute forcs, de Bruijn cycles, bubble languages, cool-lex order, lexicographic order, combinatorial enumeration, stacker-crane problem, traveling salesman problem, middle levels, fixed-density de Bruijn cycle, fixed-content, UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science, UVic Subject Index::Sciences and Engineering::Mathematics

Dostupnosť: http://hdl.handle.net/1828/1966

Energy-Efficient Algorithms for . . .

Autori: Susanne Albers HIROSHI FUJIWARA The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Susanne Albers HIROSHI FUJIWARA The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.pitt.edu/~kirk/cs3150spring2010/a49-albers.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Analyis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Variable-speed processor, flow time, online algorithms, competitive analysis, offline algorithms, dynamic programming ACM Reference Format

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6036

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6036
http://www.cs.pitt.edu/~kirk/cs3150spring2010/a49-albers.pdf

Leveraging Prediction and Reflection in a Computational Setting to Enrich Undergraduate Students' Combinatorial Thinking.

Autori: Lockwood, Elise

Zdroj: Cognition & Instruction; Jul-Sep2022, Vol. 40 Issue 3, p413-455, 43p

Predmety: UNDERGRADUATES, INSTRUCTIONAL systems design, STUDENT engagement, FORECASTING, PROBLEM solving

Approximation algorithms for restricted cycle covers based on cycle decompositions

Autori: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/cs/0604020v1.pdf.

Predmety: Combinatorial Optimisation, Graph Algorithms, Approximation Algorithms, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.6266; http://arxiv.org/pdf/cs/0604020v1.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.6266
http://arxiv.org/pdf/cs/0604020v1.pdf