Výsledky vyhledávání - 68Q25: Analysis of algorithms AND problem complexity

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem: Stable approximation algorithms for the dynamic broadcast range-assignment problem

Autoři: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Přispěvatelé: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Zdroj: SIAM Journal on Discrete Mathematics. 38:790-827

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, broadcast range assignment, online algorithms, stable approximation schemes, Analysis of algorithms and problem complexity, Discrete geometry, General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 68W27, 68Q25, 01 natural sciences, Computational geometry, bounded recourse, F.2.2, F.2.3, Computer graphics, computational geometry (digital and algorithmic aspects), Computer Science - Data Structures and Algorithms, computational geometry, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, broadcast range assignement

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2112.05426
https://research.tue.nl/en/publications/e5bf163d-884a-4515-8198-681071448b9c
https://doi.org/10.4230/LIPIcs.SWAT.2022.15
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.15

Mixed Precision HODLR Matrices: Mixed precision HODLR matrices

Autoři: Erin Carson Xinye Chen Xiaobo Liu a další

Přispěvatelé: Erin Carson Xinye Chen Xiaobo Liu a další

Zdroj: SIAM Journal on Scientific Computing. 47:A1408-A1435

Témata: hierarchical matrices, Hierarchical matrices, 65D18, Roundoff error, mixed precision computing, Analysis of algorithms and problem complexity, 65G50, 65F55, 68Q25, 65D18, 68Q25, Numerical methods for low-rank matrix approximation, matrix compression, matrix computations AMS subject classifications. 65G50, Numerical Analysis (math.NA), [INFO] Computer Science [cs], Hierarchical matrices mixed precision computing matrix computations AMS subject classifications. 65G50 65F55 68Q25 65D18, Numerical aspects of computer graphics, image analysis, and computational geometry, FOS: Mathematics, Mathematics - Numerical Analysis, matrix computations, 65F55

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.21637
https://hal.science/hal-05066310v1
https://doi.org/10.1137/24m1683925
https://hal.science/hal-05066310v1/document

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems: Interpolation conditions for linear operators and applications to performance estimation problems

Autoři: Nizar Bousselmi Julien M. Hendrickx François Glineur a další

Přispěvatelé: Nizar Bousselmi Julien M. Hendrickx François Glineur a další

Zdroj: SIAM Journal on Optimization, Vol. 34, no.3, p. 3033-3063 (2024)

Témata: Convex programming, Analysis of algorithms and problem complexity, exact convergence rates, interpolation conditions, 0211 other engineering and technologies, 02 engineering and technology, Quadratic programming, performance estimation, Numerical methods involving duality, primal-dual algorithms, first-order algorithms, linear operators, Optimization and Control (math.OC), FOS: Mathematics, Semidefinite programming, 90C25, 90C20, 68Q25, 90C22, 49M29, quadratic functions, Mathematics - Optimization and Control

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2302.08781
https://zbmath.org/7909893
https://doi.org/10.1137/23m1575391
https://hdl.handle.net/2078.1/293045

HODLR3D: hierarchical matrices for N-body problems in three dimensions: HODLR3D: hierarchical matrices for \(N\)-body problems in three dimensions

Autoři: Kandappan, V. A. Gujjula, Vaishnavi Ambikasaran, Sivaram

Zdroj: Numerical Algorithms. 97:1635-1672

Témata: hierarchical matrices, 68Q25, 68R10, 68U05, 45B05, 68U20, \(N\)-body problems, HODLR, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Computer graphics, computational geometry (digital and algorithmic aspects), FOS: Mathematics, Fredholm integral equations, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Simulation

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2307.16303
https://zbmath.org/7958575
https://doi.org/10.1007/s11075-024-01765-4

On the parenthesisations of matrix chains: All are useful, few are essential: On the parenthesisations of matrix chains: all are useful, few are essential

Autoři: Francisco López Lars Karlsson Paolo Bientinesi

Zdroj: Journal of Combinatorial Optimization. 49

Témata: Matrix multiplication, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Matrix chain, Computer Sciences, Analysis of algorithms and problem complexity, matrix multiplication, Mathematical programming, Theory of compilers and interpreters, Approximation algorithm, Approximation algorithms, linear algebra compilers, matrix chain, 68N20, 68Q25, 68W25, Datavetenskap (datalogi), Linear algebra compilers, approximation algorithm, Computer Science - Discrete Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2303.17352
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-238200

Improved Bounds for the Expected Number of k-Sets: Improved bounds for the expected number of \(k\)-sets

Autoři: Brett Leroux Luis Rademacher

Zdroj: Discrete & Computational Geometry. 70:790-815

Témata: Lattices and convex bodies in \(2\) dimensions (aspects of discrete geometry), random point configurations, Analysis of algorithms and problem complexity, Probability (math.PR), Metric Geometry (math.MG), 52C05, 52C10, 05C30, 60D05, 68Q25, 0102 computer and information sciences, Enumeration in graph theory, 01 natural sciences, Erdős problems and related topics of discrete geometry, \(k\)-set, Mathematics - Metric Geometry, \(k\)-facet, FOS: Mathematics, Mathematics - Combinatorics, Geometric probability and stochastic geometry, Combinatorics (math.CO), 0101 mathematics, Mathematics - Probability, geometric set systems

Popis souboru: application/xml

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

A deterministic algorithm for the discrete logarithm problem in a semigroup

Autoři: Tinani Simran Rosenthal Joachim

Zdroj: Journal of Mathematical Cryptology, Vol 16, Iss 1, Pp 141-155 (2022)

Témata: discrete logarithm problem, semigroups, complexity of algorithms, 20m13, 68q25, 94a60, Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://doaj.org/toc/1862-2984

Přístupová URL adresa: https://doaj.org/article/dce4f7c6cf5340c5a48cd71e503fbd93

On complexity of the word problem in braid groups and mapping class groups

Autoři: Hessam Hamidi-Tehrani

Zdroj: Topology and its Applications. 105:237-259

Témata: Fundamental group, presentations, free differential calculus, π1 -train-track, Analysis of algorithms and problem complexity, Topology of the Euclidean \(2\)-space, \(2\)-manifolds, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Geometric Topology (math.GT), Complexity, 0102 computer and information sciences, Braid groups, Artin groups, mapping class groups, 20F10, 68Q25, 57S05, 01 natural sciences, Word problem, word problems, Mathematics - Geometric Topology, Mapping class group, Braid group, FOS: Mathematics, braid groups, Geometry and Topology, 0101 mathematics, Measured train-track

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/math/9809154
https://www.sciencedirect.com/science/article/pii/S0166864199000632
https://www.sciencedirect.com/science/article/abs/pii/S0166864199000632

An Online Algorithm for Improving Performance in Navigation: An online algorithm for improving performance in navigation

Autoři: Avrim Blum Prasad Chalasani

Zdroj: SIAM Journal on Computing. 29:1907-1938

Témata: FOS: Computer and information sciences, learning, online algorithms, Analysis of algorithms and problem complexity, exploration vs.\ exploitation, robot path planning, 68Q25, 02 engineering and technology, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, unfamiliar terrain, lower bounds, Computer Science - Computational Complexity, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, competitive analysis, Combinatorics (math.CO), 0101 mathematics, navigation

Popis souboru: application/xml

Přístupová URL adresa: http://www.aladdin.cs.cmu.edu/papers/pdfs/y2000/navig.pdf
http://arxiv.org/pdf/math/9409224
http://arxiv.org/abs/math/9409224
https://zbmath.org/1519235
https://doi.org/10.1137/s0097539795290593
https://arxiv.org/abs/math/9409224
https://dblp.uni-trier.de/db/conf/focs/focs93.html#BlumC93
https://www.computer.org/csdl/proceedings-article/focs/1993/0366887/12OmNx965CH
https://epubs.siam.org/doi/pdf/10.1137/S0097539795290593
https://ieeexplore.ieee.org/document/366887/
http://ieeexplore.ieee.org/document/366887/
https://epubs.siam.org/doi/10.1137/S0097539795290593
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp29.html#BlumC00
https://locus.siam.org/doi/abs/10.1137/S0097539795290593

The full Steiner tree problem

Autoři: Chin Lung Lu Chuan Yi Tang Richard Chia Tung Lee

Zdroj: Theoretical Computer Science. 306:55-67

Témata: Full Steiner tree problem, Analysis of algorithms and problem complexity, Evolutionary tree, 0102 computer and information sciences, Approximation algorithm, 01 natural sciences, Approximation algorithms, Theoretical Computer Science, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0101 mathematics, Approximation algorithmq17 68q25 68w25, MAX SNP-hard, Phylogenetic tree, NP-complete, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://ir.nctu.edu.tw:443/bitstream/11536/27537/1/000185261500004.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs306.html#LuTL03
https://www.sciencedirect.com/science/article/abs/pii/S0304397503002093
https://doi.org/10.1016/S0304-3975(03)00209-3
https://www.sciencedirect.com/science/article/pii/S0304397503002093
https://dl.acm.org/doi/10.5555/2780722.2781476

The complexity of approximating PSPACE-Complete problems for hierarchical specifications: The complexity of approximating PSPACE-complete problems for hierarchical specifications

Autoři: Marathe, Madhav V. Hunt, Harry B. III Ravi, S. S.

Témata: FOS: Computer and information sciences, Specification and verification (program logics, model checking, etc.), Analysis of algorithms and problem complexity, 68Q25, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, hierarchically specified graphs, Computer Science - Computational Complexity, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), Graph theory (including graph drawing) in computer science, polynomial time approximation algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Complexity classes (hierarchies, relations among complexity classes, etc.), Mathematics - Combinatorics, Combinatorics (math.CO)

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/math/9409225
https://zbmath.org/751134

A simple linear-time algorithm for finding path-decompositions of small width

Autoři: Kevin Cattell Michael R. Fellows Michael J. Dinneen

Zdroj: Information Processing Letters. 57:197-203

Témata: Analysis of algorithms and problem complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorial problems, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Analysis of algorithms, Combinatorics (math.CO), 05c85 68q25, Algorithms

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/pdf/math/9410211
http://arxiv.org/abs/math/9410211
https://zbmath.org/984784
https://doi.org/10.1016/0020-0190(95)00190-5
http://www.sciencedirect.com/science/article/pii/0020019095001905
https://doi.org/10.1016/0020-0190(95)00190-5
https://core.ac.uk/display/23584468
https://dblp.uni-trier.de/db/journals/ipl/ipl57.html#CattellDF96
http://ui.adsabs.harvard.edu/abs/1994math.....10211C/abstract
https://arxiv.org/pdf/math/9410211

Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems

Autoři: Jaffke, Lars Jansen, Bart M. P.

Témata: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, 05C85, 68Q25, F.2.2, G.2.2, text

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

Kronecker's and Newton's Approaches to Solving: A First Comparison: Kronecker's and Newton's approaches to solving: a first comparison

Autoři: J.E. Morais D. Castro K. Hägele a další

Zdroj: Journal of Complexity. 17:212-303

Témata: Statistics and Probability, Control and Optimization, Analysis of algorithms and problem complexity, height of diophantine varieties, Newton operator, Symbolic computation and algebraic computation, 01 natural sciences, approximate zero, Mathematics - Algebraic Geometry, FOS: Mathematics, Computational aspects of field theory and polynomials, Mathematics - Numerical Analysis, Number Theory (math.NT), 0101 mathematics, degree of algebraic varieties, Nonnumerical algorithms, Algebraic Geometry (math.AG), 11D72,11J17,11J61,11J68, 11Y05, 68Q25, Numerical Analysis, Algebra and Number Theory, Mathematics - Number Theory, straight-line programs, Applied Mathematics, Turing machine complexity, Numerical Analysis (math.NA), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Numerical computation of solutions to single equations, Kronecker's solution

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/math/9908082
http://www.tara.tcd.ie/bitstream/2262/13021/1/TCD-CS-1999-47.pdf
https://www.sciencedirect.com/science/article/abs/pii/S0885064X00905727
https://www.sciencedirect.com/science/article/pii/S0885064X00905727
https://dblp.uni-trier.de/db/journals/jc/jc17.html#CastroPHM01
https://core.ac.uk/display/82226566
http://www.tara.tcd.ie/handle/2262/13021

From monomials to words to graphs: From monomials to words to graphs.

Autoři: Arnaldo Mandel Cristina G. Fernandes Edward L. Green

Zdroj: Journal of Combinatorial Theory, Series A. 105:185-206

Témata: Free semigroups, generators and relations, word problems, polynomials, Analysis of algorithms and problem complexity, 68R15, Group Theory (math.GR), 0102 computer and information sciences, 16Z05, Commutative Algebra (math.AC), Polynomials, 01 natural sciences, Theoretical Computer Science, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, 0101 mathematics, Comparability graphs, 13P10, NP-complete, 05C17, 68Q25, Mathematics - Commutative Algebra, blocking polyhedra, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, comparability graphs, Gröbner bases, Combinatorics (math.CO), NP-complete problems, Mathematics - Group Theory, Blocking polyhedron

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/math/0302252
https://zbmath.org/2083268
https://doi.org/10.1016/j.jcta.2003.11.001
https://core.ac.uk/display/81213511
https://www.sciencedirect.com/science/article/abs/pii/S0097316503001833
https://dblp.uni-trier.de/db/journals/jct/jcta105.html#FernandesGM04
https://www.sciencedirect.com/science/article/pii/S0097316503001833

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

Markov chain decomposition for convergence rate analysis

Autoři: Madras, Neal Randall, Dana

Zdroj: Ann. Appl. Probab. 12, no. 2 (2002), 581-606

Témata: 65C05, decomposition, Analysis of algorithms and problem complexity, Markov chain, Metropolis-Hastings algorithm, 68Q25, simulated tempering, 01 natural sciences, 60J05, Discrete-time Markov processes on general state spaces, spectral gap, Numerical analysis or methods applied to Markov chains, 0101 mathematics, Monte Carlo

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://projecteuclid.org/journals/annals-of-applied-probability/volume-12/issue-2/Markov-chain-decomposition-for-convergence-rate-analysis/10.1214/aoap/1026915617.pdf
https://zbmath.org/1906189
https://doi.org/10.1214/aoap/1026915617
https://projecteuclid.org/journals/annals-of-applied-probability/volume-12/issue-2/Markov-chain-decomposition-for-convergence-rate-analysis/10.1214/aoap/1026915617.full
https://projecteuclid.org/download/pdf_1/euclid.aoap/1026915617
http://projecteuclid.org/euclid.aoap/1026915617

The size of triangulations supporting a given link

Autoři: King, Simon A

Zdroj: Geom. Topol. 5, no. 1 (2001), 369-398

Témata: Analysis of algorithms and problem complexity, link, Triangulating manifolds, 68Q25, bridge number, Geometric Topology (math.GT), triangulation, 01 natural sciences, Rubinstein-Thompson algorithm, Mathematics - Geometric Topology, Link, normal surfaces, Rubinstein–Thompson algorithm, 57M25, FOS: Mathematics, Knots and links in the \(3\)-sphere, 57Q15, 57M25, 57Q15, 68Q25, 0101 mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://msp.org/gt/2001/5-1/gt-v5-n1-p13-p.pdf
http://arxiv.org/abs/math/0007032
https://arxiv.org/pdf/math/0007032
https://www.emis.de/journals/UW/gt/ftp/main/2001/2001s13.pdf
https://projecteuclid.org/journals/geometry-and-topology/volume-5/issue-1/The-size-of-triangulations-supporting-a-given-link/10.2140/gt.2001.5.369.short
https://tubiblio.ulb.tu-darmstadt.de/9020/
https://projecteuclid.org/download/pdf_1/euclid.gt/1513882994
https://msp.org/gt/2001/5-1/p13.xhtml
https://msp.org/gt/2001/5-1/gt-v5-n1-p13-p.pdf
https://projecteuclid.org/euclid.gt/1513882994

The fundamental class of a rational space, the graph coloring problem and other classical decision problems

Autoři: Lechuga, Luis Murillo, Aniceto

Zdroj: Bull. Belg. Math. Soc. Simon Stevin 8, no. 3 (2001), 451-467

Témata: rational homotopy, graph coloring problem, Rational homotopy theory, Analysis of algorithms and problem complexity, 68Q25, Rational spaces, 0102 computer and information sciences, NP-hard, Sullivan model, 01 natural sciences, k-coloring, 55P62, 05C15, Coloring of graphs and hypergraphs, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, decision problems

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://zbmath.org/1690570
https://projecteuclid.org/journals/bulletin-of-the-belgian-mathematical-society-simon-stevin/volume-8/issue-3/The-fundamental-class-of-a-rational-space-the-graph-coloring/10.36045/bbms/1102714569.full
https://projecteuclid.org/download/pdf_1/euclid.bbms/1102714569
http://projecteuclid.org/euclid.bbms/1102714569

A stochastically quasi-optimal search algorithm for the maximum of the simple random walk

Autoři: Chassaing, P. Marckert, J. F. Yor, M. a další

Přispěvatelé: Chassaing, P. Marckert, J. F. Yor, M. a další

Zdroj: Ann. Appl. Probab. 13, no. 4 (2003), 1264-1295

Témata: [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], searching, stochastic order, Sums of independent random variables, random walks, 68P10, Analysis of algorithms and problem complexity, 68Q25, Central limit and other weak theorems, 16. Peace & justice, 01 natural sciences, random walk, 60F17, 90B40, 60J65, Inequalities, stochastic orderings, Analysis of algorithms, Brownian motion, 0101 mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://zbmath.org/2063739
https://doi.org/10.1214/aoap/1069786499
https://projecteuclid.org/download/pdf_1/euclid.aoap/1069786499
https://projecteuclid.org/journals/annals-of-applied-probability/volume-13/issue-4/A-stochastically-quasi-optimal-search-algorithm-for-the-maximum-of/10.1214/aoap/1069786499.full
https://hal.science/hal-00104835v1
http://projecteuclid.org/euclid.aoap/1069786499