Search Results - 68Q25: Analysis of algorithms AND problem complexity~
-
1
Authors: et al.
Contributors: et al.
Source: SIAM Journal on Discrete Mathematics. 38:790-827
Subject Terms: 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
File Description: application/xml; application/pdf
-
2
Authors: et al.
Contributors: et al.
Source: SIAM Journal on Scientific Computing. 47:A1408-A1435
Subject Terms: 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
File Description: application/xml; application/pdf
-
3
Authors: et al.
Contributors: et al.
Source: SIAM Journal on Optimization, Vol. 34, no.3, p. 3033-3063 (2024)
Subject Terms: 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
File Description: application/xml
-
4
Authors:
Source: Numerical Algorithms. 97:1635-1672
Subject Terms: 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
File Description: application/xml
-
5
Authors:
Source: Journal of Combinatorial Optimization. 49
Subject Terms: 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
File Description: application/xml; application/pdf
-
6
Authors:
Source: Discrete & Computational Geometry. 70:790-815
Subject Terms: 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
File Description: application/xml
Access URL: http://arxiv.org/abs/2106.04782
-
7
Authors:
Source: Journal of Mathematical Cryptology, Vol 16, Iss 1, Pp 141-155 (2022)
Subject Terms: discrete logarithm problem, semigroups, complexity of algorithms, 20m13, 68q25, 94a60, Mathematics, QA1-939
File Description: electronic resource
Relation: https://doaj.org/toc/1862-2984
-
8
Authors: Hessam Hamidi-Tehrani
Source: Topology and its Applications. 105:237-259
Subject Terms: 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
File Description: application/xml
-
9
Authors:
Source: SIAM Journal on Computing. 29:1907-1938
Subject Terms: 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
File Description: application/xml
Access URL: 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 -
10
Authors:
Source: Theoretical Computer Science. 306:55-67
Subject Terms: 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)
File Description: application/xml
Access URL: 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 -
11
Authors:
Subject Terms: 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)
File Description: application/xml
-
12
Authors:
Source: Information Processing Letters. 57:197-203
Subject Terms: 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
File Description: application/xml
Access URL: 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 -
13
Authors:
-
14
Authors: et al.
Source: Journal of Complexity. 17:212-303
Subject Terms: 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
File Description: application/xml
Access URL: 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 -
15
Authors:
Source: Journal of Combinatorial Theory, Series A. 105:185-206
Subject Terms: 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
File Description: application/xml
Access URL: 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 -
16
Authors:
Source: Mathematical Programming; May2021, Vol. 187 Issue 1/2, p579-615, 37p
-
17
Authors:
Source: Ann. Appl. Probab. 12, no. 2 (2002), 581-606
Subject Terms: 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
File Description: application/xml; application/pdf
Access URL: 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 -
18
Authors: King, Simon A
Source: Geom. Topol. 5, no. 1 (2001), 369-398
Subject Terms: 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
File Description: application/xml; application/pdf
Access URL: 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 -
19
Authors:
Source: Bull. Belg. Math. Soc. Simon Stevin 8, no. 3 (2001), 451-467
Subject Terms: 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
File Description: application/xml; application/pdf
Access URL: 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 -
20
Authors: et al.
Contributors: et al.
Source: Ann. Appl. Probab. 13, no. 4 (2003), 1264-1295
Subject Terms: [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
File Description: application/xml; application/pdf
Access URL: 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
Nájsť tento článok vo Web of Science 
Full Text Finder