:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Duda, Jarek
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2402.04916
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
por: Bok, Jan, et al.
Publicado: (2021)

The complexity of strong conflict-free vertex-connection $k$-colorability
por: Hsieh, Sun-Yuan, et al.
Publicado: (2024)

Monitoring graph edges via shortest paths: computational complexity and approximation algorithms
por: Colli, Giordano
Publicado: (2025)

Higher order PCA-like rotation-invariant features for detailed shape descriptors modulo rotation
por: Duda, Jarek
Publicado: (2026)

On optimal distinguishers for Planted Clique
por: Nagda, Ansh, et al.
Publicado: (2025)

A (1.999999)-approximation ratio for vertex cover problem
por: Zohrehbandian, Majid
Publicado: (2024)

Random regular graph states are complex at almost any depth
por: Ghosh, Soumik, et al.
Publicado: (2024)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
por: Dumas, Maël, et al.
Publicado: (2022)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
por: Esmer, Barış Can, et al.
Publicado: (2022)

On the complexity of the Maker-Breaker happy vertex game
por: Hilaire, Mathieu, et al.
Publicado: (2026)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

Simple Circuit Extensions for XOR in PTIME
por: Carmosino, Marco, et al.
Publicado: (2025)

Simple general magnification of circuit lower bounds
por: Atserias, Albert, et al.
Publicado: (2025)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

On the Complexity of Target Set Selection in Simple Geometric Networks
por: Dvořák, Michal, et al.
Publicado: (2023)

Reachability In Simple Neural Networks
por: Sälzer, Marco, et al.
Publicado: (2022)

On the approximability of graph visibility problems
por: Bilò, Davide, et al.
Publicado: (2024)

The edge of the asymptotic spectrum of tensors
por: Alman, Josh, et al.
Publicado: (2026)

Disjoint covering of bipartite graphs with $s$-clubs
por: Monti, Angelo, et al.
Publicado: (2024)

Two Simple Proofs of Müller's Theorem
por: Epstein, Samuel
Publicado: (2024)

Simple Norm Bounds for Polynomial Random Matrices via Decoupling
por: Tulsiani, Madhur, et al.
Publicado: (2024)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

Between proper and square coloring of planar graphs, hardness and extremal graphs
por: Delépine, Thomas
Publicado: (2026)

Non-real Poles and Irregularity of Distribution
por: Lowry-Duda, David
Publicado: (2019)

Sensitivity and Hamming graphs
por: Asensio, Sara, et al.
Publicado: (2025)

Simple Linear Loops: Algebraic Invariants and Applications
por: Manssour, Rida Ait El, et al.
Publicado: (2024)

Precise estimates of invariant distances on strongly pseudoconvex domains
por: Kosiński, Łukasz, et al.
Publicado: (2023)

Canonization of a random circulant graph by counting walks
por: Verbitsky, Oleg, et al.
Publicado: (2023)

On the complexity of embedding in graph products
por: Biedl, Therese, et al.
Publicado: (2023)

Complexity of learning matchings and half graphs via edge queries
por: Mande, Nikhil S., et al.
Publicado: (2025)

Proportionally dense subgraphs of maximum size in degree-constrained graphs
por: Baghirova, Narmina, et al.
Publicado: (2024)

Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
por: Cai, Jin-Yi, et al.
Publicado: (2024)

Canonization of a random graph by two matrix-vector multiplications
por: Verbitsky, Oleg, et al.
Publicado: (2023)

Dichotomies for \#CSP on graphs that forbid a clique as a minor
por: Meng, Boning, et al.
Publicado: (2025)

Simple approximation algorithms for Polyamorous Scheduling
por: Biktairov, Yuriy, et al.
Publicado: (2024)

Determining unit distance graphs with coordinates in $\mathbb{Z}^2$ is NP-complete
por: Binnendyk, Eric
Publicado: (2025)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
por: Nelson, Jon, et al.
Publicado: (2025)

The toral contractions and $Γ$-distinguished $Γ$-contractions
por: Pal, Sourav, et al.
Publicado: (2022)

The Borsuk number of a graph
por: Cáceres, José, et al.
Publicado: (2026)

Evolutionary dynamics of any multiplayer game on regular graphs
por: Wang, Chaoqian, et al.
Publicado: (2024)