Shranjeno v:
| Glavni avtor: | Colli, Giordano |
|---|---|
| Format: | Preprint |
| Izdano: |
2025
|
| Teme: | |
| Online dostop: | https://arxiv.org/abs/2506.12021 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
Podobne knjige/članki
On graphs coverable by k shortest paths
od: Dumas, Maël, et al.
Izdano: (2022)
od: Dumas, Maël, et al.
Izdano: (2022)
Centrality of shortest paths: Algorithms and complexity results
od: Phosavanh, Johnson, et al.
Izdano: (2024)
od: Phosavanh, Johnson, et al.
Izdano: (2024)
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
od: Bilò, Davide, et al.
Izdano: (2025)
od: Bilò, Davide, et al.
Izdano: (2025)
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
od: Bilò, Davide, et al.
Izdano: (2024)
od: Bilò, Davide, et al.
Izdano: (2024)
Phase transition in the computational complexity of the shortest common superstring and genome assembly
od: Fernandez, L. A., et al.
Izdano: (2022)
od: Fernandez, L. A., et al.
Izdano: (2022)
Isometric path complexity of graphs
od: Chakraborty, Dibyayan, et al.
Izdano: (2022)
od: Chakraborty, Dibyayan, et al.
Izdano: (2022)
Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
od: Chakraborty, Dibyayan, et al.
Izdano: (2024)
od: Chakraborty, Dibyayan, et al.
Izdano: (2024)
On the approximability of graph visibility problems
od: Bilò, Davide, et al.
Izdano: (2024)
od: Bilò, Davide, et al.
Izdano: (2024)
A new metric for evaluating the performance and complexity of computer programs: A new approach to the traditional ways of measuring the complexity of algorithms and estimating running times
od: Folea, Rares, et al.
Izdano: (2025)
od: Folea, Rares, et al.
Izdano: (2025)
Algorithms and complexity for monitoring edge-geodetic sets in graphs
od: Foucaud, Florent, et al.
Izdano: (2024)
od: Foucaud, Florent, et al.
Izdano: (2024)
On the power of counting the total number of computation paths of NPTMs
od: Bakali, Eleni, et al.
Izdano: (2023)
od: Bakali, Eleni, et al.
Izdano: (2023)
The complexity of computing in continuous time: space complexity is precision
od: Blanc, Manon, et al.
Izdano: (2024)
od: Blanc, Manon, et al.
Izdano: (2024)
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
od: Le, Hoang-Oanh, et al.
Izdano: (2023)
od: Le, Hoang-Oanh, et al.
Izdano: (2023)
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
od: Esmer, Barış Can, et al.
Izdano: (2022)
od: Esmer, Barış Can, et al.
Izdano: (2022)
Quantum algorithms for path and cycle containment problems
od: Cornelissen, Arjan, et al.
Izdano: (2026)
od: Cornelissen, Arjan, et al.
Izdano: (2026)
On the complexity of embedding in graph products
od: Biedl, Therese, et al.
Izdano: (2023)
od: Biedl, Therese, et al.
Izdano: (2023)
Is a LOCAL algorithm computable?
od: Cruciani, Antonio, et al.
Izdano: (2026)
od: Cruciani, Antonio, et al.
Izdano: (2026)
Faster algorithms for graph homomorphism via tractable constraint satisfaction
od: Carbonnel, Clément
Izdano: (2026)
od: Carbonnel, Clément
Izdano: (2026)
Unconventional complexity classes in unconventional computing (extended abstract)
od: Porreca, Antonio E.
Izdano: (2024)
od: Porreca, Antonio E.
Izdano: (2024)
Simple inexpensive vertex and edge invariants distinguishing dataset strongly regular graphs
od: Duda, Jarek
Izdano: (2024)
od: Duda, Jarek
Izdano: (2024)
Simple approximation algorithms for Polyamorous Scheduling
od: Biktairov, Yuriy, et al.
Izdano: (2024)
od: Biktairov, Yuriy, et al.
Izdano: (2024)
Hunting a rabbit: complexity, approximability and some characterizations
od: Ben-Ameur, Walid, et al.
Izdano: (2025)
od: Ben-Ameur, Walid, et al.
Izdano: (2025)
Lower bounds for quantum-inspired classical algorithms via communication complexity
od: Mande, Nikhil S., et al.
Izdano: (2024)
od: Mande, Nikhil S., et al.
Izdano: (2024)
Quantum computational complexity of matrix functions
od: Cifuentes, Santiago, et al.
Izdano: (2024)
od: Cifuentes, Santiago, et al.
Izdano: (2024)
Positive Univariate Polynomials: SOS certificates, algorithms, bit complexity, and T-systems
od: Bender, Matías, et al.
Izdano: (2025)
od: Bender, Matías, et al.
Izdano: (2025)
Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
od: Cai, Jin-Yi, et al.
Izdano: (2024)
od: Cai, Jin-Yi, et al.
Izdano: (2024)
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
od: Dell, Holger, et al.
Izdano: (2022)
od: Dell, Holger, et al.
Izdano: (2022)
On the complexity of unique quantum witnesses and quantum approximate counting
od: Anshu, Anurag, et al.
Izdano: (2024)
od: Anshu, Anurag, et al.
Izdano: (2024)
Physical complexity and black hole quantum computers
od: Reilly, Michele, et al.
Izdano: (2025)
od: Reilly, Michele, et al.
Izdano: (2025)
A $4/3$ ratio approximation algorithm for the Tree Augmentation Problem by deferred local-ratio and climbing
od: Kortsarz, Guy
Izdano: (2026)
od: Kortsarz, Guy
Izdano: (2026)
On the complex zeros and the computational complexity of approximating the reliability polynomial
od: Bencs, Ferenc, et al.
Izdano: (2025)
od: Bencs, Ferenc, et al.
Izdano: (2025)
Learning complexity of gradient descent and conjugate gradient algorithms
od: Jiao, Xianqi, et al.
Izdano: (2024)
od: Jiao, Xianqi, et al.
Izdano: (2024)
On the complexity of computing Strahler numbers
od: Ganardi, Moses, et al.
Izdano: (2025)
od: Ganardi, Moses, et al.
Izdano: (2025)
On the parameterized complexity of computing good edge-labelings
od: de Andrade, Davi, et al.
Izdano: (2024)
od: de Andrade, Davi, et al.
Izdano: (2024)
Nine lower bound conjectures on streaming approximation algorithms for CSPs
od: Singer, Noah G.
Izdano: (2025)
od: Singer, Noah G.
Izdano: (2025)
On the complexity and approximability of Bounded access Lempel Ziv coding
od: Cicalese, Ferdinando, et al.
Izdano: (2024)
od: Cicalese, Ferdinando, et al.
Izdano: (2024)
A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
od: Gan, Luyining, et al.
Izdano: (2023)
od: Gan, Luyining, et al.
Izdano: (2023)
Reducing the complexity of computing the values of a Nash equilibrium
od: Chatterjee, Debtoru, et al.
Izdano: (2025)
od: Chatterjee, Debtoru, et al.
Izdano: (2025)
A universal bound on the space complexity of Directed Acyclic Graph computations
od: Bilardi, Gianfranco, et al.
Izdano: (2024)
od: Bilardi, Gianfranco, et al.
Izdano: (2024)
Polynomial kernels for edge modification problems towards block and strictly chordal graphs
od: Dumas, Maël, et al.
Izdano: (2022)
od: Dumas, Maël, et al.
Izdano: (2022)
Podobne knjige/članki
-
On graphs coverable by k shortest paths
od: Dumas, Maël, et al.
Izdano: (2022) -
Centrality of shortest paths: Algorithms and complexity results
od: Phosavanh, Johnson, et al.
Izdano: (2024) -
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
od: Bilò, Davide, et al.
Izdano: (2025) -
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
od: Bilò, Davide, et al.
Izdano: (2024) -
Phase transition in the computational complexity of the shortest common superstring and genome assembly
od: Fernandez, L. A., et al.
Izdano: (2022)