-
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem Inf. Comput. (IF 1.0) Pub Date : 2024-03-06 Satyadev Nandakumar, Subin Pulari, Akhil S
Finite-state dimension, introduced by Dai, Lathrop, Lutz and Mayordomo quantifies the information rate in an infinite sequence as measured by finite-state automata. In this paper, we define a relative version of finite-state dimension. The finite-state relative dimension of a sequence relative to is the finite-state dimension of measured using the class of finite-state gamblers with oracle access to
-
r-indexing the eBWT Inf. Comput. (IF 1.0) Pub Date : 2024-03-05 Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino
The extended Burrows-Wheeler Transform (eBWT) was introduced by Mantaci et al. [TCS 2007] to extend the definition of the BWT to a collection of strings. As opposed to other commonly used BWT-variants for string collections, the eBWT is independent of the input order of the strings in the collection, while preserving the full functionality and compressibility of the classic BWT. In our prior work [Boucher
-
Monomial Boolean functions with large high-order nonlinearities Inf. Comput. (IF 1.0) Pub Date : 2024-02-12 Jinjie Gao, Haibin Kan, Yuan Li, Jiahua Xu, Qichun Wang
Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher order nonlinearities of some monomial Boolean functions.
-
Constructing and indexing the bijective and extended Burrows–Wheeler transform Inf. Comput. (IF 1.0) Pub Date : 2024-02-09 Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Pia̧tkowski
The Burrows–Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The is a bijective variant of it that has not yet been studied for text indexing applications. We fill this gap by proposing a self-index built on the bijective BWT. The self-index applies the backward search technique of the FM-index to find a pattern with backward search steps
-
Minimal session types for the π-calculus Inf. Comput. (IF 1.0) Pub Date : 2024-01-26 Alen Arslanagić, Jorge A. Pérez, Anda-Amelia Palamariuc
Session types are a type-based approach to correct message-passing programs. A session type specifies a channel's protocol as of exchanges. Aiming to uncover the essential notions of session-based concurrency, prior work defined session types (MSTs), a formulation of session types without the sequentiality construct, and showed a : every process typable with standard session types can be transformed
-
Solving mean-payoff games via quasi dominions Inf. Comput. (IF 1.0) Pub Date : 2024-01-26 Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
We propose a novel algorithm for the solution of that merges together two seemingly unrelated concepts introduced in the context of parity games, namely and . We show that the integration of the two notions can be highly beneficial and significantly speeds up convergence to the problem solution. Experiments show that the resulting algorithm performs orders of magnitude better than the asymptotically-best
-
Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class Inf. Comput. (IF 1.0) Pub Date : 2024-01-24 Fengrong Zhang, Enes Pasalic, Amar Bapić, Baocang Wang
We show that the direct sum, under more relaxed conditions compared to those of Polujan and Pott (2020), can generate bent functions provably outside the completed Maiorana-McFarland class (). We also show that the indirect sum method of generating bent functions, by imposing certain conditions (which are completely absent if only the bentness of the resulting function is required) on the initial bent
-
Approximating the directed path partition problem Inf. Comput. (IF 1.0) Pub Date : 2024-01-19 Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang
Given a digraph , the -path partition problem aims to find a minimum collection of vertex-disjoint directed paths, of order at most , to cover all the vertices. The problem has various applications. Its special case on undirected graphs is NP-hard when , and has received much study recently from the approximation algorithm perspective. However, the general problem on digraphs is seemingly untouched
-
Projection theorems using effective dimension Inf. Comput. (IF 1.0) Pub Date : 2024-01-17 Neil Lutz, D.M. Stull
In this paper we use the theory of computing to study fractal dimensions of projections in Euclidean spaces. A fundamental result in fractal geometry is Marstrand's projection theorem, which states that for every analytic set , for almost every line , the Hausdorff dimension of the orthogonal projection of onto is maximal.
-
-
Special Issue on 13th International Conference on Security and Cryptography for Networks (SCN 2022) Inf. Comput. (IF 1.0) Pub Date : 2024-01-12 Clemente Galdi, Stanislaw Jarecki
Abstract not available
-
The reflective higher-order calculus: Encodability, typability and separation Inf. Comput. (IF 1.0) Pub Date : 2024-01-12 Stian Lybech
The -calculus (Reflective Higher-Order Calculus) of Meredith and Radestock is a -calculus-like language with unusual features, notably, structured names, runtime generation of free names, and the lack of a scoping operator. These features pose interesting difficulties for proofs of encodability, type system soundness and separation results. We describe two errors in a previous attempt to encode the
-
Growth and irreducibility in path-incompressible trees Inf. Comput. (IF 1.0) Pub Date : 2024-01-09 George Barmpalias, Xiaoyan Zhang
We study randomness-preserving transformations of path-incompressible trees, namely trees of finite randomness deficiency. We characterize their branching density, and show: (a) sparse perfect path-incompressible trees can be effectively densified, almost surely; (b) there exists a path-incompressible tree with infinitely many paths which does not compute any perfect path-incompressible tree with computable
-
Cost-asymmetric memory hard password hashing Inf. Comput. (IF 1.0) Pub Date : 2024-01-04 Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri
In the past decade billions of user passwords have been exposed to the dangerous threat of offline password cracking attacks. An offline attacker who has stolen the cryptographic hash of a user's password can check as many password guesses as s/he likes limited only by the resources that s/he is willing to invest to crack the password. Pepper and key-stretching are two techniques that have been proposed
-
Scooby: Improved multi-party homomorphic secret sharing based on FHE Inf. Comput. (IF 1.0) Pub Date : 2023-12-29 Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Barry Van Leeuwen
In this paper we present new constructions of multi-party homomorphic secret sharing (HSS) based on a new primitive that we call (HEDS). Our first scheme, which we call , is based on many popular fully homomorphic encryption (FHE) schemes with a linear decryption property. achieves an -party HSS for general circuits with complexity , as opposed to for the prior best construction based on multi-key
-
The membership problem for subsemigroups of GL2(Z) is NP-complete Inf. Comput. (IF 1.0) Pub Date : 2023-12-23 Paul C. Bell, Mika Hirvensalo, Igor Potapov
We show that the problem of determining if the identity matrix belongs to a finitely generated semigroup of 2×2 matrices from the General Linear Group GL2(Z) is solvable in NP. We extend this to prove that the membership problem is decidable in NP for GL2(Z) and for any arbitrary regular expression over matrices from the Special Linear group SL2(Z). We show that determining if a given finite set of
-
Functionality of compositions of top-down tree transducers is decidable Inf. Comput. (IF 1.0) Pub Date : 2023-12-15 Sebastian Maneth, Helmut Seidl, Martin Vu
We prove that functionality of compositions of top-down tree transducers is decidable by reducing the problem to the functionality of one top-down tree transducer with look-ahead.
-
Towards non-iterative calculation of the zeros of the Riemann zeta function Inf. Comput. (IF 1.0) Pub Date : 2023-12-14 Yu. Matiyasevich
We introduce a family of rational functions RN(a,d0,d1,…,dN) with the following property. Let d0,d1,…,dN be equal respectively to the value of some function f(s) and the values of its first N derivatives calculated at a certain complex number a lying not too far from a zero ρ of this function. It is expected that the value of RN(a,d0,d1,…,dN) is very close to ρ. We demonstrate this phenomenon on several
-
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs Inf. Comput. (IF 1.0) Pub Date : 2023-11-30 Olga Martynova
This paper proves the decidability of the emptiness problem for two models which recognize finite graphs: graph-walking automata, and tilings of graphs by star subgraphs (star automata). Furthermore, it is proved that the non-emptiness problem for graph-walking automata (that is, whether a given automaton accepts at least one graph) is NEXP-complete. For star automata, which generalize nondeterministic
-
Fast synchronization of inhomogenous random automata Inf. Comput. (IF 1.0) Pub Date : 2023-12-05 Balázs Gerencsér, Zsombor Várkonyi
We examine the reset threshold of randomly generated deterministic automata. We present a simple proof that an automaton with a random mapping and two random permutation letters has a reset threshold of O(nlog3n) with high probability, assuming only certain partial independence of the letters. Our observation is motivated by Nicaud (2019) providing a near-linear bound in the case of two random mapping
-
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas Inf. Comput. (IF 1.0) Pub Date : 2023-11-30 Robert Bredereck, Junjie Luo
Judgment aggregation is a framework to aggregate individual opinions on multiple, logically connected issues into a collective outcome. It is open to manipulative attacks such as Manipulation where judges (e.g., referees, experts, or jurors) cast their judgments strategically. Previous works have shown that most computational problems corresponding to these manipulative attacks are NP-hard. This desired
-
Realizability problem for constraint LTL Inf. Comput. (IF 1.0) Pub Date : 2023-11-24 Ashwin Bhaskar, M. Praveen
Constraint linear-time temporal logic (CLTL) is an extension of LTL that is interpreted on sequences of valuations of variables over an infinite domain. Atomic formulas can constrain valuations over a range of positions along a sequence, with the range being bounded by a parameter depending on the formula. The satisfiability and model checking problems for CLTL have been studied before. We consider
-
Succinct data structure for path graphs Inf. Comput. (IF 1.0) Pub Date : 2023-11-20 Girish Balakrishnan, Sankardeep Chakraborty, N.S. Narayanaswamy, Kunihiko Sadakane
We consider the problem of designing a succinct data structure for path graphs, that generalizes interval graphs, on n vertices while efficiently supporting degree, adjacency, and neighbourhood queries. We provide the following two solutions for this problem: 1. an nlogn+o(nlogn)-bit succinct data structure that supports adjacency query in O(logn) time, neighbourhood query in O(dlogn) time and
-
Choosing the right algorithm with hints from complexity theory Inf. Comput. (IF 1.0) Pub Date : 2023-11-24 Shouda Wang, Weijie Zheng, Benjamin Doerr
Choosing a suitable algorithm from the myriads of different search heuristics is difficult when faced with a novel optimization problem. In this work, we argue that the purely academic question of what could be the best possible algorithm in a certain broad class of black-box optimizers can give fruitful indications in which direction to search for good established heuristics. We demonstrate this approach
-
-
Clustering categorical data: Soft rounding k-modes Inf. Comput. (IF 1.0) Pub Date : 2023-11-15 Surya Teja Gavva, , Sharath Punna
Over the last three decades, researchers have intensively explored various clustering tools for categorical data analysis. Despite the proposal of various clustering algorithms, the classical k-modes algorithm remains a popular choice for unsupervised learning of categorical data. Surprisingly, our first insight is that in a natural generative block model, the k-modes algorithm performs poorly for
-
On the codewords of generalized Reed-Muller codes reaching the fourth weight Inf. Comput. (IF 1.0) Pub Date : 2023-11-13 Somayyeh Golalizadeh, Nasrin Soltankhah
Recently, the fourth weight of generalized Reed-Muller codes Rq(a(q−1)+b,m) have been characterized for 3≤b
-
Early detection of temporal constraint violations Inf. Comput. (IF 1.0) Pub Date : 2023-11-10 Isaac Mackey, Raghubir Chimni, Jianwen Su
Software systems rely on events for logging, coordination, handling unusual situations, and more. Monitoring event streams from systems that provide services can ensure the service complies with policies, regulations, and other business rules. Notably, monitoring to detect violations of rules as early as possible is much desired as, for example, the service may reclaim more resources from erring enactments
-
Exchange of indivisible goods under matroid constraints Inf. Comput. (IF 1.0) Pub Date : 2023-10-21 Jinshan Zhang, Bo Tang, Jianwei Yin
We study the problem of reallocating indivisible goods among a set of strategic agents by generalizing the original Sharpley-Scarf market to the setting where an object can be allocated to multiple agents but subject to an associated matroid constraint. We refer to this modified market as the matroid Sharpley-Scarf market. For this general market, we present a Pareto-optimal, individually rational
-
Transduction from trees to graphs through folding Inf. Comput. (IF 1.0) Pub Date : 2023-10-21 Martin Berglund, Henrik Björklund, Johanna Björklund, Adrien Boiret
We introduce a fold operation that realises a tree-to-graph transduction by merging selected nodes in the input tree to form a possibly cyclic output graph. The work is motivated by the increasing use of graph-based representations in semantic parsing. We show that a suitable class of graphs languages can be generated by applying the fold operation to regular unranked tree languages. We investigate
-
Roadmap of post-quantum cryptography standardization: Side-channel attacks and countermeasures Inf. Comput. (IF 1.0) Pub Date : 2023-10-20 Ari Shaller, Linir Zamir, Mehrdad Nojoumian
Quantum computing utilizes properties of quantum physics to build a fast-computing machine that can perform quantum computations. This will eventually lead to faster and more efficient calculations especially when we deal with complex problems. However, there is a downside related to this hardware revolution since the security of widely used cryptographic schemes, e.g., RSA encryption scheme, relies
-
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces Inf. Comput. (IF 1.0) Pub Date : 2023-10-13 Masahiro Hamano
This paper concerns a stochastic construction of probabilistic coherent spaces by employing novel ingredients (i) linear exponential comonad arising properly in the measure-theory (ii) continuous orthogonality between measures and measurable functions. A linear exponential comonad is constructed over a symmetric monoidal category of transition kernels, relaxing Markov kernels of Panangaden's stochastic
-
Bideterministic weighted automata Inf. Comput. (IF 1.0) Pub Date : 2023-09-22 Peter Kostolányi
A finite automaton is called bideterministic if it is both deterministic and codeterministic – that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated. All trim bideterministic weighted automata over integral domains and over positive semirings are proved to be minimal. On the contrary, it is observed that this property
-
Weighted two-way transducers Inf. Comput. (IF 1.0) Pub Date : 2023-09-22 Fan Feng, Andreas Maletti
Weighted two-way transducers over complete commutative semirings are introduced and investigated. Their computed mappings have two-way definable support. Conversely, for every two-way definable relation R there exists a mapping that has support R and is computable by a weighted two-way transducer. The class of all such computed mappings is naturally closed under sum. Finally, both the subclass computed
-
Online search with a hint Inf. Comput. (IF 1.0) Pub Date : 2023-09-20 Spyros Angelopoulos
We introduce the study of search problems, in a setting in which the searcher has some information, or hint concerning the hiding target. In particular, we focus on one of the fundamental problems in search theory, namely the linear search problem. Here, an immobile target is hidden at some unknown position on an unbounded line, and a mobile searcher, initially positioned at some specific point of
-
Synchronizing deterministic push-down automata can be really hard Inf. Comput. (IF 1.0) Pub Date : 2023-09-19 Henning Fernau, Petra Wolf, Tomoyuki Yamakami
The question if a deterministic finite automaton admits a software reset in the form of a so-called synchronizing word can be answered in polynomial time. In this paper, we extend this algorithmic question to deterministic automata beyond finite automata. We prove that the question of synchronizability becomes undecidable even when looking at deterministic one-counter automata. This is also true for
-
Topologies for error-detecting variable-length codes Inf. Comput. (IF 1.0) Pub Date : 2023-09-15 Jean Néraud
Given a finite alphabet A and a quasi-metric d over A⁎, we introduce the relation τd,k⊆A⁎×A⁎ such that (x,y)∈τd,k holds whenever d(x,y)≤k. The error detection capability of variable-length codes is expressed in term of conditions over τd,k. With respect to the prefix metric, the factor one, and any quasi-metric associated with some free monoid (anti-)automorphism, we prove that one can decide whether
-
Algorithmic aspects of secure domination in unit disk graphs Inf. Comput. (IF 1.0) Pub Date : 2023-09-07 Cai-Xia Wang, Yu Yang, Shou-Jun Xu
Given a graph G with vertex set V, a set S⊆V is a secure dominating set of G if S is a dominating set of G and if for every vertex u∈V∖S, there exists a vertex v∈S adjacent to u such that (S∪{u})∖{v} is a dominating set of G.The minimum secure dominating set (or, for short, MSDS) problem asks to find an MSDS in a given graph. In this paper, we first show that the decision version of the MSDS problem
-
Efficient construction of the BWT for repetitive text using string compression Inf. Comput. (IF 1.0) Pub Date : 2023-08-29 Diego Díaz-Domínguez, Gonzalo Navarro
We present a new semi-external algorithm that builds the Burrows–Wheeler transform variant of Bauer et al. (a.k.a., BCR BWT) in linear expected time. Our method uses compression techniques to reduce computational costs when the input is massive and repetitive. Concretely, we build on induced suffix sorting (ISS) and resort to run-length and grammar compression to maintain our intermediate results in
-
Temporal logics with language parameters Inf. Comput. (IF 1.0) Pub Date : 2023-08-25 Jens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz
We develop a generic framework to extend the logics LTL, CTL+ and CTL⁎ by automata-based connectives from formal language classes and analyse this framework with regard to regular languages, visibly pushdown languages, deterministic and non-deterministic context-free languages. More precisely, we consider how the use of different automata classes changes the expressive power of the logics and provide
-
New Characterizations of Primitive Permutation Groups with Applications to Synchronizing Automata Inf. Comput. (IF 1.0) Pub Date : 2023-08-25 Stefan Hoffmann
We give new characterizations of primitive permutation groups related to the notion of completely reachable automata and to the property of an automaton having a set of synchronizing words of maximal possible state complexity. Without reference to automata, given a finite permutation group on n elements we show that the following properties (and variants thereof) are equivalent: (1) the permutation
-
Further improvements for SAT in terms of formula length Inf. Comput. (IF 1.0) Pub Date : 2023-08-24 Junqiang Peng, Mingyu Xiao
In this paper, we prove that the general CNF satisfiability problem can be solved in O⁎(1.0638L) time, where L is the length of the input CNF-formula (i.e., the total number of literals in the formula), which improves the previous result of O⁎(1.0652L) obtained in 2009. Our algorithm was analyzed by using the measure-and-conquer method. Our improvements are mainly attributed to the following two points:
-
Taming Strategy Logic: Non-Recurrent Fragments Inf. Comput. (IF 1.0) Pub Date : 2023-08-24 Massimo Benerecetti, Fabio Mogavero, Adriano Peron
Strategy Logic ( for short) is one of the prominent languages for reasoning about the strategic abilities of agents in a multi-agent setting. This logic extends with first-order quantifiers over the agent strategies and encompasses other formalisms, such as and . The model-checking problem for and several of its fragments has been extensively studied. On the other hand, the picture is much less clear
-
On the complexity of decision problems for some classes of machines and applications Inf. Comput. (IF 1.0) Pub Date : 2023-08-24 Oscar H. Ibarra, Ian McQuillan
We study the computational complexity of important decision problems — including general membership, fixed-machine membership, emptiness, disjointness, equivalence, containment, universe, and finiteness problems — for various restrictions and combinations of two-way nondeterministic reversal-bounded multicounter machines (2NCM) and two-way pushdown automata. We show that the general membership problem
-
The tail-recursive fragment of timed recursive CTL Inf. Comput. (IF 1.0) Pub Date : 2023-08-22 Florian Bruse, Martin Lange
Timed Recursive CTL (TRCTL) was recently proposed as a merger of two extensions of the well-known branching-time logic CTL: Timed CTL on one hand is interpreted over real-time systems like timed automata, and Recursive CTL (RecCTL) on the other hand obtains high expressiveness through the introduction of a recursion operator. Model checking for the resulting logic is known to be 2-EXPTIME-complete
-
Building a small and informative phylogenetic supertree Inf. Comput. (IF 1.0) Pub Date : 2023-08-22 Jesper Jansson, Konstantinos Mampentzidis, T.P. Sandhya
We combine two fundamental optimization problems related to the construction of phylogenetic trees called maximum rooted triplets consistency and minimally resolved supertree into a new problem, which we call q-maximum rooted triplets consistency (q-MAXRTC). It takes as input a set R of rooted, binary phylogenetic trees with three leaves each and asks for a phylogenetic tree with exactly q internal
-
Pspace-completeness of the temporal logic of sub-intervals and suffixes Inf. Comput. (IF 1.0) Pub Date : 2023-08-22 Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala
In this paper, we prove Pspace-completeness of the finite satisfiability and model checking problems for the fragment of Halpern and Shoham interval logic with modality 〈E〉, for the “suffix” relation on pairs of intervals, and modality 〈D〉, for the “sub-interval” relation, under the homogeneity assumption. The result significantly improves the Expspace upper bound recently established for the same
-
Modelling mutual exclusion in a process algebra with time-outs Inf. Comput. (IF 1.0) Pub Date : 2023-08-10 Rob van Glabbeek
I show that in a standard process algebra extended with time-outs one can correctly model mutual exclusion in such a way that starvation-freedom holds without assuming fairness or justness, even when one makes the problem more challenging by assuming memory accesses to be atomic. This can be achieved only when dropping the requirement of speed independence.
-
Extending the reach of the point-to-set principle Inf. Comput. (IF 1.0) Pub Date : 2023-08-03 Jack H. Lutz, Neil Lutz, Elvira Mayordomo
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces Rn. These are classical questions, meaning that their statements do not involve computation or related aspects of logic. In this paper we extend the reach of the point-to-set principle from Euclidean spaces to arbitrary
-
Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs Inf. Comput. (IF 1.0) Pub Date : 2023-08-02 Yuan Feng, Sanjiang Li
Abstract interpretation, Hoare logic, and incorrectness (or reverse Hoare) logic are powerful techniques for static analysis of computer programs. They have all been successfully extended to the quantum setting, but developed largely in parallel. This paper explores the relationship between these techniques in the context of verifying quantum while-programs, where the abstract domain and the set of
-
Binary Automata Having Maximal State Complexity for the Set of Synchronizing Words Inf. Comput. (IF 1.0) Pub Date : 2023-08-01 Stefan Hoffmann
An automaton is synchronizing if there exists a word driving it into a definite state regardless of the starting state. For an n-state automaton the set of synchronizing words is a regular language that can be accepted by an automaton having 2n−n states. Here, we study n-state automata over two input letters having the property that the minimal automata for their sets of synchronizing words have 2n−n
-
Combinatory categorial grammars as generators of weighted forests Inf. Comput. (IF 1.0) Pub Date : 2023-07-25 Andreas Maletti, Lena Katharina Schiffer
Combinatory Categorial Grammar (CCG) is an extension of categorial grammar that is well-established in computational linguistics. It is mildly context-sensitive, so it is efficiently parsable and reaches an expressiveness that is suitable for describing natural languages. Weighted CCG (wCCG) are introduced as a natural extension of CCG with weights taken from an arbitrary commutative semiring. Their
-
A new class of string transformations for compressed text indexing Inf. Comput. (IF 1.0) Pub Date : 2023-07-11 Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino
Introduced about thirty years ago in the field of data compression, the Burrows-Wheeler Transform (BWT) is a string transformation that, besides being a booster of the performance of memoryless compressors, plays a fundamental role in the design of efficient self-indexing compressed data structures. Finding other string transformations with the same remarkable properties of BWT has been a challenge
-
A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption Inf. Comput. (IF 1.0) Pub Date : 2023-07-11 Renu Mary Daniel, Anitha Thomas, Elijah Blessing Rajsingh, Salaja Silas
An Authenticated Key Agreement (AKA) protocol enables two communicating parties to compute a session key with equal partnership, such that each entity is assured of the authenticity of its peer. Identity-based AKA (ID-AKA) protocols facilitate implicit authentication of the participating entities, without certificate verification. However, most of the existing ID-AKA schemes are proven secure based
-
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields Inf. Comput. (IF 1.0) Pub Date : 2023-07-03 Weiming Feng, Heng Guo, Jiaheng Wang
We study the sampling problem for the ferromagnetic Ising model with consistent external fields, and in particular, Swendsen-Wang dynamics on this model. We introduce a new grand model unifying two closely related models: the subgraph world and the random cluster model. Through this new viewpoint, we show: (1) polynomial mixing time bounds for Swendsen-Wang dynamics and (edge-flipping) Glauber dynamics
-
Achieving sequenced SQL with log-segmented timestamps Inf. Comput. (IF 1.0) Pub Date : 2023-06-24 Curtis E. Dyreson, M.A. Manazir Ahsan
In a period-timestamped, relational temporal database, each tuple is timestamped with a period. The timestamp records when the tuple is “alive” in some temporal dimension. Sequenced semantics is a special semantics for evaluating a query in a temporal database. The semantics stipulates that the query must, in effect, be evaluated simultaneously in each time instant using the tuples alive at that instant
-
Complexity classification of the eight-vertex model Inf. Comput. (IF 1.0) Pub Date : 2023-06-19 Jin-Yi Cai, Zhiguo Fu
We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or #P-hard. The dichotomy criterion is explicit. For tractability, we find some new classes of problems computable in polynomial time. For #P-hardness, we employ Möbius transformations to prove the
-
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form Inf. Comput. (IF 1.0) Pub Date : 2023-06-14 Luke Hunsberger, Roberto Posenato
A Simple Temporal Network with Uncertainty (STNU) is a data structure for reasoning about time constraints on actions that may have uncertain durations. An STNU is dispatchable if it can be executed in real-time with minimal computation 1) satisfying all constraints no matter how the uncertain durations play out and 2) retaining maximum flexibility. The fastest known algorithm for converting STNUs
-
Asymptotic elimination of partially continuous aggregation functions in directed graphical models Inf. Comput. (IF 1.0) Pub Date : 2023-06-12 Vera Koponen, Felix Weitkämper
For a finite and relational signature σ and finite domain D we consider the set WD of all σ-structures with domain D. On WD a probability distribution is determined by a so-called parametrized probabilistic graphical model, a concept studied in statistical relational artificial intelligence. We also consider a many valued logic, denoted PLA, with truth values in the unit interval for expressing queries
-
Are bundles good deals for first-order modal logic? Inf. Comput. (IF 1.0) Pub Date : 2023-06-09 Mo Liu, Anantha Padmanabha, R. Ramanujam, Yanjing Wang
Bundled products are often offered as good deals to customers. In first-order modal logic (FOML), when we bundle quantifiers and modalities together (as in ∃x□, ◇∀x, etc.), we get new logical operators whose combinations produce interesting fragments of FOML without any restriction on the arity of predicates, the number of variables, or the modal scope. It is well-known that finding decidable fragments