Výsledky vyhľadávania - "computer science - computational complexity"

A Robust Version of Heged\H{u}s's Lemma, with Applications Autor Srinivasan, Srikanth

“…Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and…”
Získať plný text

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing Autor Goldreich, Oded, Wigderson, Avi

“…A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from…”
Získať plný text

Depth, Highness and DNR degrees Autor Moser, Philippe, Stephan, Frank

“…We study Bennett deep sequences in the context of recursion theory; in particular we investigate the notions of O(1)-deepK, O(1)-deepC , order-deep K and…”
Získať plný text

The Identity Problem in the special affine group of $\mathbb{Z}^2 Autor Dong, Ruiwen

“…We consider semigroup algorithmic problems in the Special Affine group $\mathsf{SA}(2, \mathbb{Z}) = \mathbb{Z}^2 \rtimes \mathsf{SL}(2, \mathbb{Z})$, which is…”
Získať plný text

Optimal Trace Distance and Fidelity Estimations for Pure Quantum States Autor Qisheng Wang

Získať plný text

On convexity in split graphs: complexity of Steiner tree and domination Autor A. Mohanapriya, P. Renjith, N. Sadagopan

Získať plný text

On the Complexity of Target Set Selection in Simple Geometric Networks Autor Dvořák, Michal, Knop, Dušan, Schierreich, Šimon

“…We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the…”
Získať plný text

Representing Matroids over the Reals is $\exists \mathbb R$-complete Autor Kim, Eun Jung, de Mesmay, Arnaud, Miltzow, Tillmann

“…A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which…”
Získať plný text

Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3] Autor Dourado, Mitre C., Ponciano, Vitor S., da Silva, Rômulo L. O.

“…In this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We…”
Získať plný text

Conditional Dichotomy of Boolean Ordered Promise CSPs Autor Brakensiek, Joshua, Guruswami, Venkatesan, Sandeep, Sai

“…Promise Constraint Satisfaction Problems (PCSPs) are a generalization of Constraint Satisfaction Problems (CSPs) where each predicate has a strong and a weak…”
Získať plný text

Graphs with at most two moplexes Autor Clément Dallard, Robert Ganian, Meike Hatzel, Matjaž Krnc, Martin Milanič

Získať plný text

Representing polynomial of ST-CONNECTIVITY Autor Iraids, Jānis, Smotrovs, Juris

“…We show that the coefficients of the representing polynomial of any monotone Boolean function are the values of the M\"obius function of an atomistic lattice…”
Získať plný text

Polynomial kernels for edge modification problems towards block and strictly chordal graphs Autor Dumas, Maël, Perez, Anthony, Rocton, Mathis, Todinca, Ioan

“…We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in…”
Získať plný text

Sigma Partitioning: Complexity and Random Graphs Autor Dehghan, Ali, Sadeghi, Mohammad-Reza, Ahadi, Arash

“…A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and…”
Získať plný text

The Complexity of Iterated Reversible Computation Autor Eppstein, David

“…We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the…”
Získať plný text

Token Swapping on Trees Autor Biniaz, Ahmad, Jain, Kshitij, Lubiw, Anna, Masárová, Zuzana, Miltzow, Tillmann, Mondal, Debajyoti, Naredla, Anurag Murty, Tkadlec, Josef, Turcotte, Alexi

“…The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The…”
Získať plný text

Popularity on the Roommate Diversity Problem Autor Steven Ge, Toshiya Itoh

Získať plný text

Fine-grained Meta-Theorems for Vertex Integrity Autor Lampis, Michael, Mitsou, Valia

“…Vertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained…”
Získať plný text

Diversity of Answers to Conjunctive Queries Autor Merkl, Timo Camillo, Pichler, Reinhard, Skritek, Sebastian

“…Enumeration problems aim at outputting, without repetition, the set of solutions to a given problem instance. However, outputting the entire solution set may…”
Získať plný text

On the Complexity of Target Set Selection in Simple Geometric Networks Autor Dvořák, Michal, Knop, Dušan, Šimon Schierreich

“…We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the…”
Získať plný text