相关论文: Restricted Holant Dichotomy on Domains 3 and 4
Finite valued constraint satisfaction problems are a formalism for describing many natural optimization problems, where constraints on the values that variables can take come with rational weights and the aim is to find an assignment of…
In this paper we present a new class of complexity measures, induced by a new data structure for representing $k$-valued functions (operations), called minor decision diagram. The results are presented in terms of Multi-Valued Logic…
An algorithm is presented to compute Zolotarev rational functions, that is, rational functions $r_n^*$ of a given degree that are as small as possible on one set $E\subseteq\complex\cup\{\infty\}$ relative to their size on another set…
We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially…
The class of type-two basic feasible functionals ($\mathtt{BFF}_2$) is the analogue of $\mathtt{FP}$ (polynomial time functions) for type-2 functionals, that is, functionals that can take (first-order) functions as arguments.…
A new integral identity for functions with continuous second partial derivatives is derived. It is shown that the value of any function f(r,t) at position r and time t is completely determined by its previous values at all other locations…
The sharp bound for the third Hankel determinant for the coefficients of the inverse function of starlike function of order $1/2$ is obtained. In light of this, we can deduce that the functionals $|H_3(1)(f)|$ and $|H_3(1)(f^{-1})|$ exhibit…
By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…
The constraint satisfaction problem, parameterized by a relational structure, provides a general framework for expressing computational decision problems. Already the restriction to the class of all finite structures forms an interesting…
We develop a duality theory for unbounded Hermitian operators with dense domain in Hilbert space. As is known, the obstruction for a Hermitian operator to be selfadjoint or to have selfadjoint extensions is measured by a pair of deficiency…
We introduce two-sorted theories in the style of Cook and Nguyen for the complexity classes ParityL and DET, whose complete problems include determinants over GF(2) and Z, respectively. The definable functions in these theories are the…
We study the problem of query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases over signatures of arity two. We focus on the class of queries closed under homomorphisms, or, equivalently, the infinite…
The relationship between the complexity classes $P$ and $NP$ is an unsolved question in the field of theoretical computer science. In the first part of this paper, a lattice framework is proposed to handle the 3-CNF-SAT problems, known to…
Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
We detail an algorithm that -- for all but a $\frac{1}{\Omega(\log(dH))}$ fraction of $f\in\mathbb{Z}[x]$ with exactly $3$ monomial terms, degree $d$, and all coefficients in $\{-H,\ldots, H\}$ -- produces an approximate root (in the sense…
A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…
Programs must be correct with respect to their application domain. Yet, the program specification and verification approaches so far only consider correctness in terms of computations. In this work, we present a two-tier Hoare Logic that…
We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…