Related papers: Local Backbones
Discovering causal relationships from observational data, particularly in the presence of latent variables, poses a challenging problem. While current local structure learning methods have proven effective and efficient when the focus lies…
Cook's theorem is commonly expressed such as any polynomial time-verifiable problem can be reduced to the SAT problem. The proof of Cook's theorem consists in constructing a propositional formula A(w) to simulate a computation of TM, and…
In spite of the close connection between the evaluation of quantified Boolean formulas (QBF) and propositional satisfiability (SAT), tools and techniques which exploit structural properties of SAT instances are known to fail for QBF. This…
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The average-case analysis of SAT has triggered the…
We consider the Burns-Flach formulation of the equivariant Tamagawa number conjecture (ETNC). In their setup, a Tamagawa number is an element of a relative K-group. We show that this relative group agrees with an ordinary K-group, namely of…
In the article, within the framework of the Boolean Satisfiability problem (SAT), the problem of estimating the hardness of specific Boolean formulas w.r.t. a specific complete SAT solving algorithm is considered. Based on the well-known…
The weighted Maximum Satisfiability problem (weighted MAX-SAT) is a NP-hard problem with numerous applications arising in artificial intelligence. As an efficient tool for heuristic design, the backbone has been applied to heuristics design…
Selecting important features in non-linear or kernel spaces is a difficult challenge in both classification and regression problems. When many of the features are irrelevant, kernel methods such as the support vector machine and kernel…
We study testing of local properties in one-dimensional and multi-dimensional arrays. A property of $d$-dimensional arrays $f:[n]^d \to \Sigma$ is $k$-local if it can be defined by a family of $k \times \ldots \times k$ forbidden…
We consider the Quantifier Elimination (QE) problem for propositional CNF formulas with existential quantifiers. QE plays a key role in formal verification. Earlier, we presented an approach based on the following observation. To perform…
ML models are typically trained using large datasets of high quality. However, training datasets often contain inconsistent or incomplete data. To tackle this issue, one solution is to develop algorithms that can check whether a prediction…
We find lower bounds on the rank of a "real" vector bundle over an involutive space, such that "real" vector bundles of higher rank have a trivial summand and such that a stable isomorphism for such bundles implies ordinary isomorphism. We…
We aim at providing a foundation of a theory of "good" SAT representations F of boolean functions f. We argue that the hierarchy UC_k of unit-refutation complete clause-sets of level k, introduced by the authors, provides the most basic…
This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…
A matching algorithm for the identification of backbones in percolation problems is introduced. Using this procedure, percolation backbones are studied in two- to five-dimensional systems containing 1.7x10^7 sites, two orders of magnitude…
The empirical validity of the locality (LOC) principle of relativity is used to argue in favour of a local hidden variable theory (HVT) for individual quantum processes. It is shown that such a HVT may reproduce the statistical predictions…
Is quantum mechanics (QM) local or nonlocal? Different formulations/interpretations (FI) of QM, with or without hidden variables, suggest different answers. Different FI's can be viewed as different algorithms, which leads us to propose an…
We show that the Satisfiability (SAT) problem for CNF formulas with {\beta}-acyclic hypergraphs can be solved in polynomial time by using a special type of Davis-Putnam resolution in which each resolvent is a subset of a parent clause. We…
A filament consists of local maximizers of a smooth function $f$ when moving in a certain direction. A filamentary structure is an important feature of the shape of an object and is also considered as an important lower dimensional…
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…