样式: 排序: IF: - GO 导出 标记为已读
-
Branching bisimulation semantics for quantum processes Inf. Process. Lett. (IF 0.5) Pub Date : 2024-03-16 Hao Wu, Qizhe Yang, Huan Long
-
Smaller kernels for two vertex deletion problems Inf. Process. Lett. (IF 0.5) Pub Date : 2024-03-15 Dekel Tsur
-
Long directed detours: Reduction to 2-Disjoint Paths Inf. Process. Lett. (IF 0.5) Pub Date : 2024-03-13 Ashwin Jacob, Michał Włodarczyk, Meirav Zehavi
In the problem, we look for an -path that is at least vertices longer than a shortest one. We study the parameterized complexity of when parameterized by : this falls into the research paradigm of ‘parameterization above guarantee’. Whereas the problem is known to be fixed-parameter tractable (FPT) on undirected graphs, the status of on directed graphs remains highly unclear: it is not even known to
-
Sparsifying Count Sketch Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-29 Bhisham Dev Verma, Rameshwar Pratap, Punit Pankaj Dubey
The seminal work of Charikar et al. called suggests a sketching algorithm for real-valued vectors that has been used in frequency estimation for data streams and pairwise inner product estimation for real-valued vectors etc. One of the major advantages of over other similar sketching algorithms, such as random projection, is that its running time, as well as the sparsity of sketch, depends on the sparsity
-
Red Blue Set Cover problem on axis-parallel hyperplanes and other objects Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-29 V.P. Abidha, Pradeesha Ashok
Given a universe of a finite set of red elements , and a finite set of blue elements and a family of subsets of , the problem is to find a subset of that covers all blue elements of and minimum number of red elements from .
-
Regular resolution effectively simulates resolution Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-28 Sam Buss, Emre Yolcu
Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs in regular resolution while admitting polynomial-size proofs in resolution. Thus, with respect to the usual notion of simulation, regular resolution is separated
-
Prenex universal first-order safety properties Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-28 Besik Dundua, Ioane Kapanadze, Helmut Seidl
We show that every prenex universal syntactic first-order safety property can be compiled into a universal invariant of a first-order transition system using quantifier-free substitutions only. We apply this insight to prove that every such safety property is decidable for first-order transition systems with stratified guarded updates only.
-
Learning-augmented maximum flow Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-28 Adam Polak, Maksym Zub
We propose a framework for speeding up maximum flow computation by using predictions. A prediction is a flow, i.e., an assignment of non-negative flow values to edges, which satisfies the flow conservation property, but does not necessarily respect the edge capacities of the actual instance (since these were unknown at the time of learning). We present an algorithm that, given an -edge flow network
-
The group factorization problem in finite groups of Lie type Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-28 Haibo Hong, Shi Bai, Fenghao Liu
With the development of Lie theory, Lie groups have profound significance in many branches of mathematics and physics. In Lie theory, matrix exponential plays a crucial role between Lie groups and Lie algebras. Meanwhile, as finite analogues of Lie groups, finite groups of Lie type also have wide application scenarios in mathematics and physics owning to their unique mathematical structures. In this
-
Tight inapproximability of Nash equilibria in public goods games Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-27 Jérémi Do Dinh, Alexandros Hollender
We study public goods games, a type of game where every player has to decide whether or not to produce a good which is , i.e., neighboring players can also benefit from it. Specifically, we consider a setting where the good is indivisible and where the neighborhood structure is represented by a directed graph, with the players being the nodes. Papadimitriou and Peng (2023) recently showed that in this
-
Recognizing LBFS trees of bipartite graphs Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-09 Robert Scheffler
The graph searches Breadth First Search (BFS) and Depth First Search (DFS) and the spanning trees constructed by them are some of the most basic concepts in algorithmic graph theory. BFS trees are first-in trees, i.e., every vertex is connected to its first visited neighbor. DFS trees are last-in trees, i.e., every vertex is connected to the last visited neighbor before it. The problem whether a given
-
On size-independent sample complexity of ReLU networks Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-07 Mark Sellke
We study the sample complexity of learning ReLU neural networks from the point of view of generalization. Given norm constraints on the weight matrices, a common approach is to estimate the Rademacher complexity of the associated function class. Previously obtained a bound independent of the network size (scaling with a product of Frobenius norms) except for a factor of the square-root depth. We give
-
Skolem and positivity completeness of ergodic Markov chains Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-07 Mihir Vahanwala
We consider the following Markov Reachability decision problems that view Markov Chains as Linear Dynamical Systems: given a finite, rational Markov Chain, source and target states, and a rational threshold, does the probability of reaching the target from the source at the step: (i) equal the threshold for some ? (ii) cross the threshold for some ? (iii) cross the threshold for infinitely many ? These
-
-
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities Inf. Process. Lett. (IF 0.5) Pub Date : 2024-02-05 Dimitar P. Guelev, Ben Moszkowski
Recently we established an analog of Gabbay's separation theorem about linear temporal logic (LTL) for the extension of Moszkowski's discrete time propositional Interval Temporal Logic (ITL) by two sets of expanding modalities, namely the unary neighbourhood modalities and the binary weak inverses of ITL's operator. One of the many useful applications of separation in LTL is the concise proof of LTL's
-
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine Inf. Process. Lett. (IF 0.5) Pub Date : 2024-01-26 Wei Wu, Liang Tang, Andrea Pizzuti
We study a robust single-machine scheduling problem with uncertain processing times on a serial-batch processing machine to minimize maximum lateness. The problem can model many practical production and logistics applications which involve uncertain factors such as defect rates. A solution to a batch scheduling problem can be represented as a combination of a job-processing sequence and a partition
-
Splitting NP-complete sets infinitely Inf. Process. Lett. (IF 0.5) Pub Date : 2024-01-22 Liyu Zhang, Mahmoud Quweider, Fitra Khan, Hansheng Lei
Glaßer et al. (SIAMJCOMP 2009 and TCS 2009) proved that NP-complete languages are polynomial-time mitotic for the many-one reduction, meaning that each NP-complete language L can be split into two NP-complete languages L∩S and L∩S‾, where S is a language in P. It follows that every NP-complete language can be partitioned into an arbitrary finite number of NP-complete languages. We strengthen and generalize
-
On-line exploration of rectangular cellular environments with a rectangular hole Inf. Process. Lett. (IF 0.5) Pub Date : 2024-01-09 Qi Wei, Xiaolin Yao, Wenxin Zhang, Ruiyue Zhang, Yonggong Ren
This paper considers the problem of exploring an unknown rectangular cellular environment with a rectangular hole using a mobile robot. The robot's task is to visit each cell at least once and return to the start. The robot has limited visibility that can only detect four cells adjacent to it. And it has large amount of memory that can store a map of discovered cells. The goal of this work is to find
-
FPT approximation and subexponential algorithms for covering few or many edges Inf. Process. Lett. (IF 0.5) Pub Date : 2024-01-09 Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
We study the α-Fixed Cardinality Graph Partitioning (α-FCGP) problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In this problem, we are given a graph G, two numbers k,p and 0≤α≤1, the question is whether there is a set S⊆V of size k with a specified coverage function covα(S) at least p (or at most p for the minimization version). The coverage function
-
On the hardness of inclusion-wise minimal separators enumeration Inf. Process. Lett. (IF 0.5) Pub Date : 2023-12-15 Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedepth computation, the enumeration of inclusion-wise minimal separators plays a crucial role. However and quite surprisingly, the complexity status of this problem has not been settled since it has been posed as an open direction
-
Semantic flowers for good-for-games and deterministic automata Inf. Process. Lett. (IF 0.5) Pub Date : 2023-12-02 Daniele Dell'Erba, Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova
We present an innovative approach for capturing the complexity of ω-regular languages using the concept of flowers. This semantic tool combines two syntax-based definitions, namely the Mostowski hierarchy of word languages and syntactic flowers. The former is based on deterministic parity automata with a limited number of priorities, while the latter simplifies deterministic parity automata by reducing
-
Approximation error of single hidden layer neural networks with fixed weights Inf. Process. Lett. (IF 0.5) Pub Date : 2023-12-01 Vugar E. Ismailov
Neural networks with finitely many fixed weights have the universal approximation property under certain conditions on compact subsets of the d-dimensional Euclidean space, where approximation process is considered. Such conditions were delineated in our paper [26]. But for many compact sets it is impossible to approximate multivariate functions with arbitrary precision and the question on estimation
-
Computing minimal solutions to the ring loading problem Inf. Process. Lett. (IF 0.5) Pub Date : 2023-11-30 Nikolas Klug
Given a cycle graph of n nodes and a non-negative demand di,j for each pair of nodes i,j, the ring loading problem with demand splitting (RLPW) asks to determine a routing of these demands such that the maximum load on any edge is minimal. In this work, we present an algorithm for computing minimal solutions to RLPW in O(n2) time. This algorithm, when employed as a subroutine, also improves the runtimes
-
On the complexity of co-secure dominating set problem Inf. Process. Lett. (IF 0.5) Pub Date : 2023-11-27 B.S. Panda, Soumyashree Rana, Sounaka Mishra
A set D⊆V of a graph G=(V,E) is a dominating set of G if every vertex v∈V∖D is adjacent to at least one vertex in D. A set S⊆V is a co-secure dominating set (CSDS) of a graph G if S is a dominating set of G and for each vertex u∈S there exists a vertex v∈V∖S such that uv∈E and (S∖{u})∪{v} is a dominating set of G. The minimum cardinality of a co-secure dominating set of G is the co-secure domination
-
Deterministic treasure hunt and rendezvous in arbitrary connected graphs Inf. Process. Lett. (IF 0.5) Pub Date : 2023-10-23 Debasish Pattanayak, Andrzej Pelc
Treasure hunt and rendezvous are fundamental tasks performed by mobile agents in graphs. In treasure hunt, an agent has to find an inert target (called treasure) situated at an unknown node of the graph. In rendezvous, two agents, initially located at distinct nodes of the graph, traverse its edges in synchronous rounds and have to meet at some node. We assume that the graph is connected (otherwise
-
Anti Tai mapping for unordered labeled trees Inf. Process. Lett. (IF 0.5) Pub Date : 2023-10-20 Mislav Blažević, Stefan Canzar, Khaled Elbassioni, Domagoj Matijević
The well-studied Tai mapping between two rooted labeled trees T1=(V1,E1) and T2=(V2,E2) defines a one-to-one mapping between nodes in T1 and T2 that preserves ancestor relationship [1]. For unordered trees the problem of finding a maximum-weight Tai mapping is known to be NP-complete [2]. In this work, we define an anti Tai mapping M⊆V1×V2 as a binary relation between two unordered labeled trees such
-
The effect of iterativity on adversarial opinion forming Inf. Process. Lett. (IF 0.5) Pub Date : 2023-10-20 Konstantinos Panagiotou, Simon Reisser
Consider the following model to study adversarial effects on opinion forming. A set of initially selected experts form their binary opinion while being influenced by an adversary, who may convince some of them of the falsehood. All other participants in the network then take the opinion of the majority of their neighboring experts. Can the adversary influence the experts in such a way that the majority
-
Ranking and unranking bordered and unbordered words Inf. Process. Lett. (IF 0.5) Pub Date : 2023-10-12 Daniel Gabric
A border of a word w is a word that is both a non-empty proper prefix and suffix of w. If w has a border, then it is said to be bordered; otherwise, it is said to be unbordered. The main results of this paper are the first algorithms to rank and unrank length-n bordered and unbordered words over a k-letter alphabet. We show that, under the unit-cost RAM model, ranking bordered and unbordered words
-
Discrete and mixed two-center problems for line segments Inf. Process. Lett. (IF 0.5) Pub Date : 2023-10-13 Sukanya Maji, Sanjib Sadhu
Given a set of n non-intersecting line segments L and a set Q of m points in R2; we present algorithms of the discrete two-center problem for (i) covering, (ii) stabbing and (iii) hitting the set L in (i) O(m(m+n)log2n), (ii) O(m2nlogn) and (iii) O(m(m+n)log2n) time respectively, where the two disks are centered at two points of Q and radius of the larger disk is minimized. We also study the mixed
-
Vertex-connectivity for node failure identification in Boolean Network Tomography Inf. Process. Lett. (IF 0.5) Pub Date : 2023-10-10 Nicola Galesi, Fariba Ranjbar, Michele Zito
We study the node failure identification problem in undirected graphs by means of Boolean Network Tomography. We argue that vertex-connectivity plays a central role. We prove bounds on the maximum number of simultaneous node failures that can be identified in arbitrary networks. We argue that (augmented) grids are a class of networks with large failure identifiability, and provide very tight results
-
Inapproximability of counting independent sets in linear hypergraphs Inf. Process. Lett. (IF 0.5) Pub Date : 2023-09-29 Guoliang Qiu, Jiaheng Wang
It is shown in this note that approximating the number of independent sets in a k-uniform linear hypergraph with maximum degree at most Δ is NP-hard if Δ≥5⋅2k−1+1. This confirms that for the relevant sampling and approximate counting problems, the regimes on the maximum degree where the state-of-the-art algorithms work are tight, up to some small factors. These algorithms include: the approximate sampler
-
Checking in polynomial time whether or not a regular tree language is deterministic top-down Inf. Process. Lett. (IF 0.5) Pub Date : 2023-09-29 Sebastian Maneth, Helmut Seidl
It is well known that for a given bottom-up tree automaton it can be decided whether or not an equivalent deterministic top-down tree automaton exists. Recently it was claimed that such a decision can be carried out in polynomial time (Leupold and Maneth, FCT'2021); but their procedure and corresponding property is wrong. Here we address this mistake and present a correct property which allows to determine
-
The facility location problem with maximum distance constraint Inf. Process. Lett. (IF 0.5) Pub Date : 2023-09-20 Xiaowei Li, Xiwen Lu
Motivated by practical problems, we investigate the facility location problem with maximum distance constraint, which requires that the distance from each customer to open facilities must not exceed a given threshold value of L. The goal is to minimise the sum of the opening costs of the facilities. We show that this problem is NP-hard and analyse its lower bound. As no (α,1)-approximation algorithm
-
Relating planar graph drawings to planar satisfiability problems Inf. Process. Lett. (IF 0.5) Pub Date : 2023-09-18 Md. Manzurul Hasan, Debajyoti Mondal, Md. Saidur Rahman
A SAT graph G(Φ) of a satisfiability instance Φ consists of a vertex for each clause and a vertex for each variable, where there exists an edge between a clause vertex and a variable vertex if and only if the variable or its negation appears in that clause. Many satisfiability problems, which are NP-hard, become polynomial-time solvable when the SAT graph is restricted to satisfy some graph properties
-
A new class of generalized almost perfect nonlinear monomial functions Inf. Process. Lett. (IF 0.5) Pub Date : 2023-09-15 Lijing Zheng, Haibin Kan, Jie Peng, Yanjun Li, Yanbin Zheng
In this short note, we present a new class of GAPN power functions of the type xk2p2i+k1pi+k0 over finite fields Fpn with p odd and gcd(n,i)=1 (up to EA-equivalence).
-
On semi-transitive orientability of split graphs Inf. Process. Lett. (IF 0.5) Pub Date : 2023-09-01 Sergey Kitaev, Artem Pyatkin
A directed graph is semi-transitive if and only if it is acyclic and for any directed path u1→u2→⋯→ut, t≥2, either there is no edge from u1 to ut or all edges ui→uj exist for 1≤i
-
The computational complexity of some explainable clustering problems Inf. Process. Lett. (IF 0.5) Pub Date : 2023-09-04 Eduardo Sany Laber
Let X∈Rd be a set of points and k≥2 be an integer. Dasgupta et al. [1] considered the problem of building a partition of X into k groups, induced by an axis-aligned decision tree with k leaves. The motivation is obtaining partitions that are simple to explain. We study the computational complexity of this problem for k-means, k-medians and the k-center cost-functions. We prove that the optimization
-
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher Inf. Process. Lett. (IF 0.5) Pub Date : 2023-09-01 Shion Utsumi, Motoki Nakahashi, Kosei Sakamoto, Takanori Isobe
Piccolo is a lightweight block cipher based on a 16-bit word 4-line generalized Feistel structure. Piccolo adopts byte-wise round permutation (RP) instead of the typical word-based RP to improve diffusion. In this paper, we explore the optimality of byte-based RP from the viewpoint of security. We evaluate the security of differential, linear, impossible differential, and integral attacks for all byte-wise
-
On reversing arcs to improve arc-connectivity Inf. Process. Lett. (IF 0.5) Pub Date : 2023-08-30 Pierre Hoppenot, Zoltán Szigeti
We show that if the arc-connectivity of a directed graph D is at most ⌊k+12⌋ and the reorientation of an arc set F in D results in a k-arc-connected directed graph then we can reorient one arc of F without decreasing the arc-connectivity of D. This improves a corollary of a result of Fukuda, Prodon, Sakuma [2] and one of Ito et al. [3] for k∈{2,3}.
-
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard Inf. Process. Lett. (IF 0.5) Pub Date : 2023-08-28 Reynaldo Gil-Pons, Max Ward, Loïc Miller
We consider the problem of computing an (s,d)-hypernetwork in an acyclic F-hypergraph. This is a fundamental computational problem arising in directed hypergraphs, and is a foundational step in tackling problems of reachability and redundancy. This problem was previously explored in the context of general directed hypergraphs (containing cycles), where it is NP-hard, and acyclic B-hypergraphs, where
-
Fast primal-dual update against local weight update in linear assignment problem and its application Inf. Process. Lett. (IF 0.5) Pub Date : 2023-08-05 Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi
We consider a dynamic situation in the weighted bipartite matching problem: edge weights in the input graph are repeatedly updated and we are asked to maintain an optimal matching at any moment. A trivial approach is to compute an optimal matching from scratch each time an update occurs. In this paper, we show that if each update occurs locally around a single vertex, then a single execution of Dijkstra's
-
On the non-efficient PAC learnability of conjunctive queries Inf. Process. Lett. (IF 0.5) Pub Date : 2023-07-28 Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz
This note serves three purposes: (i) we provide a self-contained exposition of the fact that conjunctive queries are not efficiently learnable in the Probably-Approximately-Correct (PAC) model, paying clear attention to the complicating fact that this concept class lacks the polynomial-size fitting property, a property that is tacitly assumed in much of the computational learning theory literature;
-
A note on hardness of computing recursive teaching dimension Inf. Process. Lett. (IF 0.5) Pub Date : 2023-07-22 Pasin Manurangsi
In this short note, we show that the problem of computing the recursive teaching dimension (RTD) for a concept class (given explicitly as input) requires nΩ(logn)-time, assuming the exponential time hypothesis (ETH). This matches the running time nO(logn) of the brute-force algorithm for the problem.
-
There is no APTAS for 2-dimensional vector bin packing: Revisited Inf. Process. Lett. (IF 0.5) Pub Date : 2023-07-22 Arka Ray
We study the Vector Bin Packing and the Vector Bin Covering problems, multidimensional generalizations of the Bin Packing and the Bin Covering problems, respectively. In the Vector Bin Packing, we are given a set of d-dimensional vectors from [0,1]d and the aim is to partition the set into the minimum number of bins such that for each bin B, each component of the sum of the vectors in B is at most
-
Steiner connectivity problems in hypergraphs Inf. Process. Lett. (IF 0.5) Pub Date : 2023-07-13 Florian Hörsch, Zoltán Szigeti
We say that a tree T is an S-Steiner tree if S⊆V(T) and a hypergraph is an S-Steiner hypertree if it can be trimmed to an S-Steiner tree. We prove that it is NP-complete to decide, given a hypergraph H and some S⊆V(H), whether there is a subhypergraph of H which is an S-Steiner hypertree. As corollaries, we give two negative results for two Steiner orientation problems in hypergraphs. Firstly, we show
-
Learning from positive and negative examples: New proof for binary alphabets Inf. Process. Lett. (IF 0.5) Pub Date : 2023-07-03 Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf
One of the most fundamental problems in computational learning theory is the problem of learning a finite automaton A consistent with a finite set P of positive examples and with a finite set N of negative examples. By consistency, we mean that A accepts all strings in P and rejects all strings in N. It is well known that this problem is NP-complete. In the literature, it is stated that NP-hardness
-
Word automatic groups of nilpotency class 2 Inf. Process. Lett. (IF 0.5) Pub Date : 2023-06-22 André Nies, Frank Stephan
We consider word automaticity for groups that are nilpotent of class 2 and have exponent a prime p. We show that the infinitely generated free group in this variety is not word automatic. In contrast, the infinite extra-special p-group Ep is word automatic, as well as an intermediate group Hp which has an infinite centre. In the last section we introduce a method for showing automaticity of central
-
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality Inf. Process. Lett. (IF 0.5) Pub Date : 2023-06-22 Shanshan Wang, Chenglong Xiao, Emmanuel Casseau
The problem of enumerating all connected induced subgraphs of a given order k from a given graph arises in many practical applications: bioinformatics, information retrieval, processor design, to name a few. The upper bound on the number of connected induced subgraphs of order k is n⋅(eΔ)k(Δ−1)k, where Δ is the maximum degree in the input graph G and n is the number of vertices in G. In this short
-
Worst-case analysis of LPT scheduling on a small number of non-identical processors Inf. Process. Lett. (IF 0.5) Pub Date : 2023-06-16 Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn
The approximation ratio of the longest processing time (LPT) scheduling algorithm has been investigated in various studies. While the tight approximation ratio is known for the cases when all processors are identical, the ratio is unknown when the processors have different speeds. In this study, we provide a tight approximation ratio for three, four, and five processors. We show that the ratios for
-
On the hull number on cycle convexity of graphs Inf. Process. Lett. (IF 0.5) Pub Date : 2023-06-14 Julio Araujo, Victor Campos, Darlan Girão, João Nogueira, António Salgueiro, Ana Silva
In this work, we study the parameter hull number in a recently defined graph convexity called Cycle Convexity, whose definition is motivated by related notions in Knot Theory. For a graph G=(V,E), define the interval function in the Cycle Convexity as Icc(S)=S∪{v∈V(G)|there is a cycle C in G such that V(C)∖S={v}}, for every S⊆V(G). We say that S⊆V(G) is convex if Icc(S)=S. The convex hull of S⊆V(G)
-
A short note on “A note on single-machine scheduling with job-dependent learning effects” Inf. Process. Lett. (IF 0.5) Pub Date : 2023-06-13 Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo
Mosheiov & Sidney [5] showed that the single-machine makespan minimization problem with job-dependent learning effects can be formulated as an assignment problem and solved in O(n3) time. Later on, Koulamas [4] showed that the scheduling problem can be solved in O(nlogn) time by sequencing the jobs according to the shortest processing time (SPT) rule if the job-dependent learning rate are correlated
-
A new key recovery attack on a code-based signature from the Lyubashevsky framework Inf. Process. Lett. (IF 0.5) Pub Date : 2023-06-13 Chik How Tan, Theo Fanuela Prabowo
In this paper, we present a new key recovery attack on a Hamming-metric code-based signature scheme proposed by Song, Huang, Mu, Wu, and Wang (SHMWW). Our attack extends the statistical part of the attack proposed by Aragon, Baldi, Deneuville, Khathuria, Persichetti, and Santini (ABDKPS). In addition to classifying the columns of the secret matrix, we also completely determine the entries of the identity
-
Simplicity in Eulerian circuits: Uniqueness and safety Inf. Process. Lett. (IF 0.5) Pub Date : 2023-06-13 Nidia Obscura Acosta, Alexandru I. Tomescu
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if a graph G has a unique Eulerian circuit can be done in polynomial time via the BEST theorem by de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte (1941–1951) [15], [16] (involving counting arborescences), or via a tailored characterization by Pevzner, 1989 (involving computing the intersection
-
Recognizing well-dominated graphs is coNP-complete Inf. Process. Lett. (IF 0.5) Pub Date : 2023-06-02 Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
A graph G is well-covered if every minimal vertex cover of G is minimum, and it is well-dominated if every minimal dominating set of G is minimum. Studies on well-covered graphs were initiated in [Plummer, JCT 1970], and well-dominated graphs were first introduced in [Finbow, Hartnell and Nowakow, AC 1988]. Well-dominated graphs are well-covered, and both classes have been widely studied in the literature
-
Linear threshold functions in decision lists, decision trees, and depth-2 circuits Inf. Process. Lett. (IF 0.5) Pub Date : 2023-05-22 Yogesh Dahiya, Vignesh K., Meena Mahajan, Karteek Sreenivasaiah
We show that polynomial-size constant-rank linear decision trees (LDTs) can be converted to polynomial-size depth-2 threshold circuits LTF∘LTF. An intermediate construct is polynomial-size decision lists that query a conjunction of a constant number of linear threshold functions (LTFs); we show that these are equivalent to polynomial-size exact linear decision lists (ELDLs) i.e. decision lists querying
-
Recursion-free modular arithmetic in the lambda-calculus Inf. Process. Lett. (IF 0.5) Pub Date : 2023-05-18 Maximilien Mackie
We investigate encodings for modular arithmetic in the lambda-calculus. There are two approaches: adapting well-known numeral systems, and building a new one. This paper focuses on providing original techniques to encode modular arithmetic directly. We present a modular arithmetic numeral system complete with multiplication and an implementation of the Chinese remainder theorem, all without recursion
-
Unbiased estimation of inner product via higher order count sketch Inf. Process. Lett. (IF 0.5) Pub Date : 2023-05-16 Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur
Count sketch [1] is one of the popular sketching algorithms widely used for frequency estimation in data streams, and pairwise inner product for real-valued vectors [2]. Recently, Shi et al. [3] extended the count sketch (CS) and suggested a higher-order count sketch (HCS) algorithm that compresses input tensors (or vectors) into succinct tensors which closely approximates the value of queried features
-
Security weakness of a certificate-based proxy signature scheme for IIoT environments Inf. Process. Lett. (IF 0.5) Pub Date : 2023-05-05 Je Hong Park, Woo-Hwan Kim
Recently, Zhu et al. analyzed a certificate-based proxy signature scheme proposed by Verma et al. and provided a revised scheme [9]. In this paper, we revisit Zhu et al.'s attack and show that the fundamental problem of the Verma et al.'s scheme is that it uses a weak ordinary signature scheme as a building block. In addition, based on the fact that the revised scheme shares many of the components
-
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions Inf. Process. Lett. (IF 0.5) Pub Date : 2023-05-05 Majid Mirzanezhad
Previous studies on Approximate Near-Neighbors Search (ANNS) among curves are either focused on curves in R1 or under the discrete Fréchet distance. In this paper, we propose the first data structure for curves under the (continuous) Fréchet distance in higher dimensions. Given a set P of n curves each with number of vertices at most m in Rd, and a fixed δ>0, we aim to preprocess P into a data structure
-
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality Inf. Process. Lett. (IF 0.5) Pub Date : 2023-05-04 Jean Liénardy, Frédéric Lafitte
OCB3 is a mature and provably secure authenticated encryption mode of operation which allows for associated data (AEAD). This note reports a small flaw in the security proof of OCB3 that may cause a loss of security in practice, even if OCB3 is correctly implemented in a trustworthy and nonce-respecting module. The flaw is present when OCB3 is used with short nonces. It has security implications that