相关论文: Matchgates Revisited

We present a formally verified framework for patent analysis as a hybrid AI + Lean 4 pipeline. The DAG-coverage core (Algorithm 1b) is fully machine-verified once bounded match scores are fixed. Freedom-to-operate, claim-construction…

Matching corresponding features between two images is a fundamental task to computer vision with numerous applications in object recognition, robotics, and 3D reconstruction. Current state of the art in image feature matching has focused on…

Matchings were among the earliest motivations for graph theory. They subsequently remained a central goal, inspiring the development of new tools that went well beyond problems directly concerning matchings. These tools proved widely…

This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from $n\cdot (n-1)$ to $n-1$. An algorithm of reconstructing of the PC matrix from its set of…

The original idea of proof nets can be formulated by means of interaction nets syntax. Additional machinery as switching, jumps and graph connectivity is needed in order to ensure correspondence between a proof structure and a correct proof…

In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…

Matching logic is a logical framework for specifying and reasoning about programs using pattern matching semantics. A pattern is made up of a number of structural components and constraints. Structural components are syntactically matched,…

Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate…

Proof by coupling is a classical technique for proving properties about pairs of randomized algorithms by carefully relating (or coupling) two probabilistic executions. In this paper, we show how to automatically construct such proofs for…

To guarantee the normal functioning of quantum devices in different scenarios, appropriate benchmarking tool kits are quite significant. Inspired by the recent progress on quantum state verification, here we establish a general framework of…

A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…

A generalized criterion for signature related algorithms to compute Gr\"obner basis is proposed in this paper. Signature related algorithms are a popular kind of algorithms for computing Gr\"obner basis, including the famous F5 algorithm,…

With privacy-preserving and traceability properties, group signature is a cryptosystem with central role in cryptography. And there are lots of application scenarios. A new extension concept of group signature is presented, namely group…

In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…

Multi-objective probabilistic model checking is a powerful technique for verifying stochastic systems against multiple (potentially conflicting) properties. To enhance the trustworthiness and explainability of model checking tools, we…

We consider the problem of testing whether a correlation matrix of a multivariate normal population is the identity matrix. We focus on sparse classes of alternatives where only a few entries are nonzero and, in fact, positive. We derive a…

We present in this work a complete session in a Mathematica notebook. The aim of this notebook is to check identities in symmetric compositions. This notebook is a complement of our work [1] and it has all the explicit computations. We…

Riemann surfaces which are set by algebraic, algebroid and inverse functions are considered. A method for describing these Riemann surfaces by graphs is proposed. Each such Riemann surface is assigned to a special type of graph - profile.…

This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov Chains and Markov Decision Processes. (Finite) paths in counterexamples are grouped together in witnesses that are likely to…

Bisimulation is crucial for verifying process equivalence in probabilistic systems. This paper presents a novel logical framework for analyzing bisimulation in probabilistic parameterized systems, namely, infinite families of finite-state…