-
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words Theory Comput. Syst. (IF 0.5) Pub Date : 2024-04-11 Ondřej Klíma, Jonatan Kolegar
The notion of a quasi-order generated by a homomorphism from the semigroup of all words onto a finite ordered semigroup was introduced by Bucher et al. (Theor. Comput. Sci. 40, 131–148 1985). It naturally occurred in their studies of derivation relations associated with a given set of context-free rules, and they asked a crucial question, whether the resulting relation is a well quasi-order. We answer
-
Revisiting the Distortion of Distributed Voting Theory Comput. Syst. (IF 0.5) Pub Date : 2024-04-05 Aris Filos-Ratsikas, Alexandros A. Voudouris
We consider a setting with agents that have preferences over alternatives and are partitioned into disjoint districts. The goal is to choose one alternative as the winner using a mechanism which first decides a representative alternative for each district based on a local election with the agents therein as participants, and then chooses one of the district representatives as the winner. Previous work
-
Pumping Lemmas Can be “Harmful” Theory Comput. Syst. (IF 0.5) Pub Date : 2024-04-05 Jingnan Xie, Harry B. Hunt III, Richard E. Stearns
A pumping lemma for a class of languages \(\varvec{\mathcal {C}}\) is often used to show particular languages are not in \(\varvec{\mathcal {C}}\). In contrast, we show that a pumping lemma for a class of languages \(\varvec{\mathcal {C}}\) can be used to study the computational complexity of the predicate “\(\in \varvec{\mathcal {C}}\)” via highly efficient many-one reductions. In this paper, we use
-
How to Hide a Clique? Theory Comput. Syst. (IF 0.5) Pub Date : 2024-04-05 Uriel Feige, Vadim Grinberg
In the well known planted clique problem, a clique (or alternatively, an independent set) of size k is planted at random in an Erdos-Renyi random G(n, p) graph, and the goal is to design an algorithm that finds the maximum clique (or independent set) in the resulting graph. We introduce a variation on this problem, where instead of planting the clique at random, the clique is planted by an adversary
-
Placing Green Bridges Optimally, with a Multivariate Analysis Theory Comput. Syst. (IF 0.5) Pub Date : 2024-04-01 Till Fluschnik, Leon Kellerhals
We study the problem of placing wildlife crossings, such as green bridges, over human-made obstacles to challenge habitat fragmentation. The main task herein is, given a graph describing habitats or routes of wildlife animals and possibilities of building green bridges, to find a low-cost placement of green bridges that connects the habitats. We develop three problem models for this task and study
-
CNF Encodings of Symmetric Functions Theory Comput. Syst. (IF 0.5) Pub Date : 2024-03-26
Abstract Many Boolean functions that need to be encoded as CNF in practice, have only exponential size CNF representations. To avoid this effect, one usually introduces nondeterministic variables. For example, whereas the minimum number of clauses in a CNF computing the parity function \(x_1\oplus x_2 \oplus \cdots \oplus x_n\) is \(2^{n-1}\) , one can use \(n-1\) nondeterministic variables to get
-
Approximation Algorithms for the MAXSPACE Advertisement Problem Theory Comput. Syst. (IF 0.5) Pub Date : 2024-03-25 Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery
-
Performing Regular Operations with 1-Limited Automata Theory Comput. Syst. (IF 0.5) Pub Date : 2024-03-14 Giovanni Pighizzini, Luca Prigioniero, Šimon Sádovský
-
Imperative Process Algebra and Models of Parallel Computation Theory Comput. Syst. (IF 0.5) Pub Date : 2024-03-14 Cornelis A. Middelburg
-
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance Theory Comput. Syst. (IF 0.5) Pub Date : 2024-03-06
Abstract The homogeneous weight (metric) is useful in the construction of codes over a ring of integers \(\mathbb {Z}_{p^l}\) (p prime and \(l \ge 1\) an integer). It becomes Hamming weight when the ring is taken to be a finite field and becomes Lee weight when the ring is taken to be \(\mathbb {Z}_{4}\) . This paper presents homogeneous weight distribution and total homogeneous weight of burst and
-
New Results on the Remote Set Problem and Its Applications in Complexity Study Theory Comput. Syst. (IF 0.5) Pub Date : 2024-03-05 Yijie Chen, Kewei Lv
-
On Non-principal Arithmetical Numberings and Families Theory Comput. Syst. (IF 0.5) Pub Date : 2024-02-23 Marat Faizrahmanov
The paper studies \(\varvec{\Sigma ^0_n}\)-computable families (\(\varvec{n\geqslant 2}\)) and their numberings. It is proved that any non-trivial \(\varvec{\Sigma ^0_n}\)-computable family has a complete with respect to any of its elements \(\varvec{\Sigma ^0_n}\)-computable non-principal numbering. It is established that if a \(\varvec{\Sigma ^0_n}\)-computable family is not principal, then any of
-
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs Theory Comput. Syst. (IF 0.5) Pub Date : 2024-02-23 Hoang-Oanh Le, Van Bang Le
-
On the Decidability of Infix Inclusion Problem Theory Comput. Syst. (IF 0.5) Pub Date : 2024-01-13
Abstract We introduce the infix inclusion problem of two languages S and T that decides whether or not S is a subset of the set of all infixes of T. This problem is motivated by the need for identifying malicious computation patterns according to their semantics, which are often disguised with additional sub-patterns surrounding information. In other words, malicious patterns are embedded as an infix
-
Farkas Bounds on Horn Constraint Systems Theory Comput. Syst. (IF 0.5) Pub Date : 2024-01-06 K. Subramani, Piotr Wojciechowki, Alvaro Velasquez
In this paper, we analyze the copy complexity of unsatisfiable Horn constraint systems, under the ADD refutation system. Recall that a linear constraint of the form \(\sum _{i=1}^{n} a_{i}\cdot x_{i} \ge b\), is said to be a horn constraint if all the \(a_{i} \in \{0,1,-1\}\) and at most one of the \(a_{i}\)s is positive. A conjunction of such constraints is called a Horn constraint system (HCS). Horn
-
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees Theory Comput. Syst. (IF 0.5) Pub Date : 2023-12-20 Ekaterina Shemetova, Alexander Okhotin, Semyon Grigorev
-
Improved Bounds for Matching in Random-Order Streams Theory Comput. Syst. (IF 0.5) Pub Date : 2023-12-12 Aaron Bernstein
-
Upper Bounds on Communication in Terms of Approximate Rank Theory Comput. Syst. (IF 0.5) Pub Date : 2023-12-12 Anna Gál, Ridwan Syed
We show that any Boolean function with approximate rank r can be computed by bounded-error quantum protocols without prior entanglement of complexity \(O( \sqrt{r} \log r)\). In addition, we show that any Boolean function with approximate rank r and discrepancy \(\delta \) can be computed by deterministic protocols of complexity O(r), and private coin bounded-error randomized protocols of complexity
-
Beyond the Existential Theory of the Reals Theory Comput. Syst. (IF 0.5) Pub Date : 2023-12-12 Marcus Schaefer, Daniel Štefankovič
We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger completeness results for various computational problems. We exhibit several families of complete problems which can be used for future completeness results in the real hierarchy
-
A Closer Look at the Expressive Power of Logics Based on Word Equations Theory Comput. Syst. (IF 0.5) Pub Date : 2023-12-11 Joel Day, Vijay Ganesh, Nathan Grewal, Matthew Konefal, Florin Manea
-
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs Theory Comput. Syst. (IF 0.5) Pub Date : 2023-12-04 Pierre Bergé, Guillaume Ducoffe, Michel Habib
-
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective Theory Comput. Syst. (IF 0.5) Pub Date : 2023-12-01 Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski
-
Disentangling the Computational Complexity of Network Untangling Theory Comput. Syst. (IF 0.5) Pub Date : 2023-11-14 Vincent Froese, Pascal Kunz, Philipp Zschoche
-
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes Theory Comput. Syst. (IF 0.5) Pub Date : 2023-11-07 Frank Gurski, Jörg Rothe, Robin Weishaupt
-
Quantum Algorithm for Lexicographically Minimal String Rotation Theory Comput. Syst. (IF 0.5) Pub Date : 2023-10-24 Qisheng Wang, Mingsheng Ying
-
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams Theory Comput. Syst. (IF 0.5) Pub Date : 2023-10-19 David E. Brown, David Skidmore
-
Toward Online Mobile Facility Location on General Metrics Theory Comput. Syst. (IF 0.5) Pub Date : 2023-10-06 Abdolhamid Ghodselahi, Fabian Kuhn
We introduce an online variant of mobile facility location (MFL) (introduced by Demaine et al. (SODA 258–267 2007)). We call this new problem online mobile facility location (OMFL). In the OMFL problem, initially, we are given a set of k mobile facilities with their starting locations. One by one, requests are added. After each request arrives, one can make some changes to the facility locations before
-
Weighted Tree Automata with Constraints Theory Comput. Syst. (IF 0.5) Pub Date : 2023-10-03 Andreas Maletti, Andreea-Teodora Nász
-
b-Coloring Parameterized by Clique-Width Theory Comput. Syst. (IF 0.5) Pub Date : 2023-09-23 Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov
-
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams Theory Comput. Syst. (IF 0.5) Pub Date : 2023-09-20 Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
-
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings Theory Comput. Syst. (IF 0.5) Pub Date : 2023-08-29 Léo Gayral, Mathieu Sablik
-
Well-Covered Graphs With Constraints On $$\Delta $$ And $$\delta $$ Theory Comput. Syst. (IF 0.5) Pub Date : 2023-08-28 Vadim E. Levit, David Tankus
-
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model Theory Comput. Syst. (IF 0.5) Pub Date : 2023-08-28 Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki
-
The Space Complexity of Sum Labelling Theory Comput. Syst. (IF 0.5) Pub Date : 2023-08-25 Henning Fernau, Kshitij Gajjar
-
Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D Theory Comput. Syst. (IF 0.5) Pub Date : 2023-08-23 David Furcy, Scott M. Summers, Logan Withers
-
Implicit Representation of Relations Theory Comput. Syst. (IF 0.5) Pub Date : 2023-08-15 Vladan Glončák, Jarl Emil Erla Munkstrup, Jakob Grue Simonsen
-
The Parameterized Complexity of s-Club with Triangle and Seed Constraints Theory Comput. Syst. (IF 0.5) Pub Date : 2023-08-12 Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
-
Stability and Welfare in (Dichotomous) Hedonic Diversity Games Theory Comput. Syst. (IF 0.5) Pub Date : 2023-08-11 Andreas Darmann
In a hedonic diversity game (HDG) there are two types of agents (red and blue agents) that need to form disjoint coalitions, i.e., subgroups of agents. Each agent’s preferences over the coalitions depend on the relative number of agents of the same type in her coalition. In the special case of a dichotomous hedonic diversity game (DHDG) each agent distinguishes between approved and disapproved fractions
-
Non-Linear Ski Rental Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-29 Boaz Patt-Shamir, Evyatar Yadai
-
Expansivity and Periodicity in Algebraic Subshifts Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-26 Jarkko Kari
-
Visit-Bounded Stack Automata Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-23 Jozef Jirásek, Ian McQuillan
-
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-17 Rodolfo Conde, Sergio Rajsbaum
-
Unit Read-once Refutations for Systems of Difference Constraints Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-12 K. Subramani, P. Wojciechowski
-
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-10 Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki
-
A Unifying Approximate Potential for Weighted Congestion Games Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-10 Yiannis Giannakopoulos, Diogo Poças
-
Computing a Partition Function of a Generalized Pattern-Based Energy over a Semiring Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-10 Rustem Takhanov
-
Lossy Kernelization of Same-Size Clustering Theory Comput. Syst. (IF 0.5) Pub Date : 2023-07-10 Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
-
On Forced Periodicity of Perfect Colorings Theory Comput. Syst. (IF 0.5) Pub Date : 2023-06-28 Pyry Herva, Jarkko Kari
-
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality Theory Comput. Syst. (IF 0.5) Pub Date : 2023-05-15 Joshua A. Grochow
There is no single canonical polynomial-time version of the Axiom of Choice (AC); several statements of AC that are equivalent in Zermelo-Fraenkel (ZF) set theory are already inequivalent from a constructive point of view, and are similarly inequivalent from a complexity-theoretic point of view. In this paper we show that many classical formulations of AC, when restricted to polynomial time in natural
-
-
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete Theory Comput. Syst. (IF 0.5) Pub Date : 2023-04-24 Stefan Göller, Mathieu Hilaire
-
Effective Guessing Has Unlikely Consequences Theory Comput. Syst. (IF 0.5) Pub Date : 2023-03-25 András Z. Salamon, Michael Wehar
-
On the Hierarchy of Swarm-automaton for the Number of Agents Theory Comput. Syst. (IF 0.5) Pub Date : 2023-02-11 Kaoru Fujioka
-
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs Theory Comput. Syst. (IF 0.5) Pub Date : 2023-01-26 Abhishek Sahu, Saket Saurabh
-
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP Theory Comput. Syst. (IF 0.5) Pub Date : 2022-12-27 Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida
For a size parameter \(s:\mathbb {N}\to \mathbb {N}\), the Minimum Circuit Size Problem (denoted by MCSP[s(n)]) is the problem of deciding whether the minimum circuit size of a given function f : {0,1}n →{0,1} (represented by a string of length N := 2n) is at most a threshold s(n). A recent line of work exhibited “hardness magnification” phenomena for MCSP: A very weak lower bound for MCSP implies
-
Random Access in Persistent Strings and Segment Selection Theory Comput. Syst. (IF 0.5) Pub Date : 2022-12-17 Philip Bille, Inge Li Gørtz
-
On Embeddability of Unit Disk Graphs Onto Straight Lines Theory Comput. Syst. (IF 0.5) Pub Date : 2022-12-17 Onur Çağırıcı
-
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning Theory Comput. Syst. (IF 0.5) Pub Date : 2022-12-17 Atri Rudra
-
A One Pass Streaming Algorithm for Finding Euler Tours Theory Comput. Syst. (IF 0.5) Pub Date : 2022-12-12 Christian Glazik, Jan Schiemann, Anand Srivastav
-
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions Theory Comput. Syst. (IF 0.5) Pub Date : 2022-12-10 M. Ogihara, K. Uchizawa