Výsledky vyhledávání - "Mathematics of computing Discrete mathematics Combinatorics"

Periods of Iterations of Functions with Restricted Preimage Sizes.

Autoři: MARTINS, RODRIGO S. V. PANARIO, DANIEL QURESHI, CLAUDIO a další

Zdroj: ACM Transactions on Algorithms; May2020, Vol. 16 Issue 3, p1-28, 28p

Témata: GAUSSIAN distribution, FINITE fields, INTEGERS, ASYMPTOTIC distribution

OASIcs, Volume 75, ATMOS'19, Complete Volume

Autoři: Cacchiani, Valentina Marchetti-Spaccamela, Alberto

Témata: Theory of computation, Design and analysis of algorithms; Mathematics of computing, Discrete mathematics; Combinatorics; Mathematical optimization, Data processing Computer science, Proceedings, publishedVersion

A CORRESPONDENCE BETWEEN ROOTED PLANAR MAPS AND NORMAL PLANAR LAMBDA TERMS.

Autoři: ZEILBERGER, NOAM GIORGETTI, ALAIN

Zdroj: Logical Methods in Computer Science (LMCS); 2015, Vol. 11 Issue 3, p1-39, 39p

Témata: MATHEMATICAL analysis, LAMBDA calculus, DATA analysis, MATHEMATICAL functions, COMPUTABILITY logic

WEAK CAT-OPERADS.

Autoři: DOŠEN, KOSTA PETRIĆ, ZORAN

Zdroj: Logical Methods in Computer Science (LMCS); 2015, Vol. 11 Issue 1, p1-38, 38p

Témata: OPERADS, PARTIAL algebras, OPERATOR theory, ISOMORPHISM (Mathematics), MONOIDS

Exponential Time Complexity of the Permanent and the Tutte Polynomial.

Autoři: DELL, HOLGER HUSFELDT, THORE MARX, DÁNIEL a další

Zdroj: ACM Transactions on Algorithms; Jul2014, Vol. 10 Issue 4, p1-32, 32p

Témata: COMPUTATIONAL complexity, TUTTE polynomial, GRAPH theory, MULTIGRAPH, MATHEMATICAL bounds, SPARSE graphs

Automatic network reconstruction from experimental time-series data: A survey.

Autoři: Wagler, Annegret

Zdroj: IT: Information Technology; Apr2014, Vol. 56 Issue 2, p46-54, 9p

Témata: PETRI nets, COMPUTATIONAL mathematics, COMPUTATIONAL complexity, TIME series analysis, NUMERICAL analysis, COMBINATORICS

PEBBLE GAMES, PROOF COMPLEXITY, AND TIME-SPACE TRADE-OFFS.

Autoři: NORDSTRÖM, JAKOB

Zdroj: Logical Methods in Computer Science (LMCS); 2013, Vol. 9 Issue 3, p1-63, 63p

Témata: GAME theory, MATHEMATICAL proofs, COMPUTATIONAL complexity, SPACETIME, MATHEMATICAL bounds, CALCULUS

Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems.

Autoři: HOCHBAUM, DORIT S. LEVIN, ASAF

Zdroj: ACM Transactions on Algorithms; Mar2013, Vol. 9 Issue 2, p1-12, 12p

Témata: APPROXIMATION theory, ALGORITHMS, MATRICES (Mathematics), CLUSTER analysis (Statistics), HEURISTIC algorithms, SET theory, COMPUTATIONAL complexity

A Generalized Minimum Cost κ-Clustering.

Autoři: Levin, Asaf

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 4, p36-36:10, 10p

Témata: FOUNDATIONS of arithmetic, CHINESE inscriptions, ORTHOGONAL polynomials, COMPLEX numbers, EXTERNALITIES, TRANSITION economies, FUNCTIONAL analysis, PROPORTION

CODING OBJECTS RELATED TO CATALAN NUMBERS.

Autoři: BEGE, ANTAL KÁSA, ZOLTÁN

Zdroj: Studia Universitatis Babeş-Bolyai, Informatica; 2001, Vol. 46 Issue 1, p31-40, 10p