Výsledky vyhledávání - 68q25 (theory of computing: analysis of algorithms and problem complexity)*

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications.

Autoři: Iwamasa, Yuni Takazawa, Kenjiro

Zdroj: Mathematical Programming. Jul2022, Vol. 194 Issue 1/2, p229-256. 28p.

Témata: *MATHEMATICAL programming, MATROIDS, COST functions, COMBINATORIAL optimization, MODULAR functions, CONVEX functions

Advances on strictly Δ-modular IPs: Advances on strictly Δ-modular IPs: M. Nägele et al.

Autoři: Nägele, Martin Nöbel, Christian Santiago, Richard a další

Zdroj: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p731-760. 30p.

Témata: *MATHEMATICAL programming, *INTEGER programming, *ALGORITHMS, COMBINATORIAL optimization, CUTTING stock problem

New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces.

Autoři: Romaguera, S. Tirado, P. Valero, O.

Zdroj: International Journal of Computer Mathematics; Sep2012, Vol. 89 Issue 13/14, p1728-1741, 14p

Témata: MATHEMATICAL analysis, ASYMPTOTIC expansions, COMPUTATIONAL complexity, ALGORITHMS, TOPOLOGICAL spaces, RECURSIVE sequences (Mathematics), PROOF theory, ASYMPTOTIC analysis

APPROXIMATE SAMPLING AND COUNTING OF GRAPHS WITH NEAR-REGULAR DEGREE INTERVALS.

Autoři: AMANATIDIS, GEORGIOS KLEER, PIETER

Zdroj: SIAM Journal on Discrete Mathematics; 2024, Vol. 38 Issue 4, p2812-2840, 29p

Témata: DISTRIBUTION (Probability theory), MARKOV processes, POLYNOMIAL approximation, COMBINATORICS, SOCIAL network analysis, REGULAR graphs

Regional complexity analysis of algorithms for nonconvex smooth optimization.

Autoři: Curtis, Frank E. Robinson, Daniel P.

Zdroj: Mathematical Programming; May2021, Vol. 187 Issue 1/2, p579-615, 37p

Témata: NONSMOOTH optimization, VALUATION of real property, FUNCTION spaces, ALGORITHMS, DIFFERENTIAL inclusions

A DETERMINISTIC SINGLE EXPONENTIAL TIME ALGORITHM FOR MOST LATTICE PROBLEMS BASED ON VORONOI CELL COMPUTATIONS.

Autoři: MICCIANCIO, DANIELE VOULGARIS, PANAGIOTIS

Zdroj: SIAM Journal on Computing; 2013, Vol. 42 Issue 3, p1364-1391, 28p

Témata: ALGORITHMS, LATTICE theory, VECTOR spaces, VECTOR analysis, VORONOI polygons, APPROXIMATION algorithms

The complexity space of partial functions: a connection between complexity analysis and denotational semantics.

Autoři: Romaguera, S. Schellekens, M.P. Valero, O.

Zdroj: International Journal of Computer Mathematics; Jun2011, Vol. 88 Issue 9, p1819-1829, 11p

Témata: COMPUTATIONAL complexity, MATHEMATICAL functions, DENOTATIONAL semantics, TOPOLOGY, FACTOR analysis, RECURSIVE functions, FIXED point theory, ALGORITHMS

SUBDETERMINANT MAXIMIZATION VIA NONCONVEX RELAXATIONS AND ANTI-CONCENTRATION.

Autoři: EBRAHIMI, JAVAD STRASZAK, DAMIAN VISHNOI, NISHEETH

Zdroj: SIAM Journal on Computing; 2020, Vol. 49 Issue 6, p1249-1270, 22p

Témata: MAXIMAL functions, ABSOLUTE value, APPROXIMATION algorithms, COMPUTER science, MATROIDS, NP-hard problems, RANDOM variables

RANDOM WALKS AND FORBIDDEN MINORS II: A poly(dε^-1)-QUERY TESTER FOR MINOR-CLOSED PROPERTIES OF BOUNDED-DEGREE GRAPHS.

Autoři: KUMAR, AKASH SESHADHRI, C. STOLMAN, ANDREW M.

Zdroj: SIAM Journal on Computing; 2023, Vol. 52 Issue 2, p323-338, 16p

Témata: RANDOM walks, PLANAR graphs, GRAPH theory, SPECTRAL theory, COMPUTER science

Conditional gradient type methods for composite nonlinear and stochastic optimization.

Autoři: Ghadimi, Saeed¹ sghadimi@princeton.edu

Zdroj: Mathematical Programming. Jan2019, Vol. 173 Issue 1/2, p431-464. 34p.

Témata: *STOCHASTIC programming, *STOCHASTIC analysis, *APPROXIMATION theory, *MATHEMATICAL optimization, *MATHEMATICS theorems

A lower bound for randomized algebraic decision trees

Autoři: Dima Grigoriev Roman Smolensky Friedhelm Meyer auf der Heide a další

Přispěvatelé: Dima Grigoriev Roman Smolensky Friedhelm Meyer auf der Heide a další

Zdroj: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. :612-619

Témata: Computational Complexity, 68Q40, Analysis of algorithms and problem complexity, 68Q25, Randomized Algebraic Decision Trees, knapsack problem, [MATH] Mathematics [math], 0102 computer and information sciences, Symbolic computation and algebraic computation, Knapsack, 01 natural sciences, Integer Programming. Subject classifications. 68Q15, randomized algebraic decision trees, Complexity classes (hierarchies, relations among complexity classes, etc.), element distinctness problem, 0101 mathematics, Element Distinctness

Popis souboru: application/pdf; application/xml

Přístupová URL adresa: https://hal.science/hal-03049442v1
https://dl.acm.org/doi/10.1145/237814.238011
https://dblp.uni-trier.de/db/conf/stoc/stoc1996.html#GrigorievKHS96
https://core.ac.uk/display/23922741
https://link.springer.com/article/10.1007%2FBF01270387
https://dblp.uni-trier.de/db/journals/cc/cc6.html#GrigorievKHS97
https://hal.archives-ouvertes.fr/hal-03049442/document
https://link.springer.com/article/10.1007/BF01270387
https://hal.archives-ouvertes.fr/hal-03049442
https://link.springer.com/content/pdf/10.1007/BF01270387.pdf

Avoiding the Global Sort: A Faster Contour Tree Algorithm.

Autoři: Raichel, Benjamin Seshadhri, C.

Zdroj: Discrete & Computational Geometry. Dec2017, Vol. 58 Issue 4, p946-985. 40p.

Témata: *TREE graphs, *PATHS & cycles in graph theory, *ALGORITHMS, *TRIANGULATION, *MATHEMATICAL bounds, *TOPOLOGY

Recent developments in information-based complexity

Autoři: Packel, Edward W. Woźniakowski, Henryk

Zdroj: Bull. Amer. Math. Soc. (N.S.) 17, no. 1 (1987), 9-36

Témata: information-based complexity, normed linear space, average case, Analysis of algorithms and problem complexity, linear problems, 65-02, 68Q25, 0101 mathematics, General theory of numerical analysis in abstract spaces, 01 natural sciences, worst case

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://www.ams.org/bull/1987-17-01/S0273-0979-1987-15511-X/S0273-0979-1987-15511-X.pdf
https://zbmath.org/4043157
https://doi.org/10.1090/s0273-0979-1987-15511-x
https://projecteuclid.org/download/pdf_1/euclid.bams/1183553961
https://www.ams.org/journals/bull/1987-17-01/S0273-0979-1987-15511-X/home.html
https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society-new-series/volume-17/issue-1/Recent-developments-in-information-based-complexity/bams/1183553961.full
https://www.ams.org/bull/1987-17-01/S0273-0979-1987-15511-X/S0273-0979-1987-15511-X.pdf
http://projecteuclid.org/euclid.bams/1183553961

Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time.

Autoři: Banks, Jess Garza-Vargas, Jorge Kulkarni, Archit a další

Zdroj: Foundations of Computational Mathematics. Dec2023, Vol. 23 Issue 6, p1959-2047. 89p.

Témata: *MATRIX multiplications, *NUMERICAL solutions for linear algebra, *MODULAR arithmetic, *LINEAR algebra, *MATRICES (Mathematics), *FACTORIZATION, *INVERSIONS (Geometry)

O (log² k / log log k )-APPROXIMATION ALGORITHM FOR DIRECTED STEINER TREE: A TIGHT QUASI-POLYNOMIAL TIME ALGORITHM.

Autoři: GRANDONI, FABRIZIO LAEKHANUKIT, BUNDIT SHI LI

Zdroj: SIAM Journal on Computing; 2023, Vol. 52 Issue 2, p298-322, 25p

Témata: APPROXIMATION algorithms, DIRECTED graphs, ALGORITHMS, LINEAR programming, COMBINATORIAL optimization, INTEGER programming, SAWLOGS

Towards a Realistic Analysis of Some Popular Sorting Algorithms

Autoři: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte a další

Přispěvatelé: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte a další

Zdroj: Combinatorics, Probability and Computing. 24:104-144

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 68Q87, 68P10, 68Q17Secondary 68W05, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 68Q25, 68W40, 94A17, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 68P05, 94A15, 01 natural sciences, 30D10, 30E20, 30E15, 97I80, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], 0101 mathematics, Primary 68W32

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01103998/file/cpc-PF-style.pdf
https://dblp.uni-trier.de/db/journals/cpc/cpc24.html#ClementTV15
https://hal.archives-ouvertes.fr/hal-01103998

A simple parallelizable method for the approximate solution of a quadratic transportation problem of large dimension with additional constraints

Autoři: Rotin, S. V. Gusakov, I. V. Gusakov, V. Ya.

Témata: FOS: Computer and information sciences, Optimization and Control (math.OC), Computer Science - Information Theory, Information Theory (cs.IT), 65K05, 90C20, 90C59, 90C90, 65Y20, 65G20, 68Q25, 68W10, 68W40, 93B40, 49M30, 0211 other engineering and technologies, FOS: Mathematics, Mathematics - Numerical Analysis, 02 engineering and technology, Numerical Analysis (math.NA), 0101 mathematics, Mathematics - Optimization and Control, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/1909.02334

On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms.

Autoři: Estevan, Asier Miñana, Juan-José Valero, Oscar

Zdroj: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales / RACSAM; Oct2019, Vol. 113 Issue 4, p3233-3252, 20p

Smoothed analysis of integer programming.

Autoři: Röglin, Heiko Vöcking, Berthold

Zdroj: Mathematical Programming; Jun2007, Vol. 110 Issue 1, p21-56, 36p, 2 Graphs

Témata: PROBABILITY theory, INTEGER programming, LINEAR programming, ALGORITHMS, MATHEMATICAL programming

A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model.

Autoři: Ezra, Esther Sharir, Micha

Zdroj: Discrete & Computational Geometry; Jun2019, Vol. 61 Issue 4, p735-755, 21p

Témata: DECISION trees, HYPERPLANES, KNAPSACK problems, COMPUTATIONAL geometry, ALGORITHMS

Korporace: ASSOCIATION for Computing Machinery