Related papers: A Solver for a Theory of Strings and Bit-vectors
Satisfiability Modulo Theory (SMT) has recently emerged as a powerful tool for solving various automated reasoning problems across diverse domains. Unlike traditional satisfiability methods confined to Boolean variables, SMT can reason on…
A string field theory of (p,q) minimal superstrings is constructed with the free-fermion realization of 2-component KP (2cKP) hierarchy, starting from 2-cut ansatz of two-matrix models. Differential operators of 2cKP hierarchy are…
The GVW algorithm is a signature-based algorithm for computing Gr\"obner bases. If the input system is not homogeneous, some J-pairs with higher signatures but lower degrees are rejected by GVW's Syzygy Criterion, instead, GVW have to…
In this paper we study a variant of string pattern matching which deals with tuples of strings known as \textit{multi-track strings}. Multi-track strings are a generalisation of strings (or \textit{single-track strings}) that have primarily…
We discuss string theory on AdS(3)xS(3)xM(4) with particular emphasis on unitarity and state-operator correspondence. The AdS-CFT correspondence, in the Minkowski signature, is re-examined by taking into account the only allowed unitary…
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrences can provide search heuristics that…
We have focused on the topological structure of Cubic string field theory (CSFT). From the similarity of action between CSFT and Chern-Simons (CS) theory in three dimensions, we have investigated the quantity ${\cal N}=\pi^2/3\int…
This paper presents segmentation-free strategies for the recognition of handwritten numeral strings of unknown length. A synthetic dataset of touching numeral strings of sizes 2-, 3- and 4-digits was created to train end-to-end solutions…
A new technique is proposed for fault-tolerant linear, sesquilinear and bijective (LSB) operations on $M$ integer data streams ($M\geq3$), such as: scaling, additions/subtractions, inner or outer vector products, permutations and…
A general algorithm is presented which gives a closed-form expression for an arbitrary perturbative diagram of cubic string field theory at any loop order. For any diagram, the resulting expression is given by an integral of a function of…
We propose an analytic framework to study the nonperturbative solutions of Witten's open string field theory. The method is based on the Moyal star formulation where the kinetic term can be split into two parts. The first one describes the…
In this dissertation we study hidden symmetries within the framework of string theory. There are two kinds of hidden symmetries investigated in this work: the first type is associated with dynamics of quantum fields and the second type is…
In this paper, which is a revised version of the author's PhD thesis, we analyze two different applications of string theory. In the first part, we focus on four dimensional compactifications of Type II string theories preserving N=1…
Bit-serial computation facilitates bit-wise sequential data processing, offering numerous benefits, such as a reduced area footprint and dynamically-adaptive computational precision. It has emerged as a prominent approach, particularly in…
Highly-repetitive collections of strings are increasingly being amassed by genome sequencing and genetic variation experiments, as well as by storing all versions of human-generated files, like webpages and source code. Existing indexes for…
We study systems of String Equations where block variables need to be assigned strings so that their concatenation gives a specified target string. We investigate this problem under a multivariate complexity framework, searching for…
Explicit examples of the AdS/CFT correspondence where both bulk and boundary theories are tractable are hard to come by, but the minimal tension string on $AdS_3 \times S^3 \times T^4$ is one notable example. In this paper, we discuss how…
In the paper, we investigate two problems on strings. The first one is the String matching problem, and the second one is the String comparing problem. We provide a quantum algorithm for the String matching problem that uses exponentially…
We study quantum algorithms for several fundamental string problems, including Longest Common Substring, Lexicographically Minimal String Rotation, and Longest Square Substring. These problems have been widely studied in the stringology…
Some recent results have introduced external-memory algorithms to compute self-indexes of a set of strings, mainly via computing the Burrows-Wheeler Transform (BWT) of the input strings. The motivations for those results stem from…