相关论文: Enumerating k-SAT functions

The problem of P vs. NP is very serious, and solutions to the problem can help save lives. This article is an attempt at solving the problem using a computer algorithm. It is presented in a fashion that will hopefully allow for easy…

The problem of identifying the satisfiability threshold of random $3$-SAT formulas has received a lot of attention during the last decades and has inspired the study of other threshold phenomena in random combinatorial structures. The…

In the field of Boolean satisfiability problems (SAT), at-most-k constraints, which suppress the number of true target variables at most k, are often used to describe objective problems. At-most-k constraints are used not only for…

We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a Boolean formula to represent each…

Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-constructive arguments show that F is satisfiable for clause/variable ratios m/n< r(k)~2^k ln 2 with high probability. Yet no efficient algorithm is…

In 2008, Cusick {\it et al.} conjectured that certain elementary symmetric Boolean functions of the form $\sigma_{2^{t+1}l-1, 2^t}$ are the only nonlinear balanced ones, where $t$, $l$ are any positive integers, and…

Let $D$ be the open unit disc in the complex plane. We denote by $\mathbb{C}$ the set of complex numbers and consider any compact set $K$ which is disjoint from $D$ and which also has connected complement. Let $A(K)$ denote all the…

We present an improvement on Thurley's recent randomized approximation scheme for #k-SAT where the task is to count the number of satisfying truth assignments of a Boolean function {\Phi} given as an n-variable k-CNF. We introduce a novel…

Let $Z(F)$ be the number of solutions of a random $k$-satisfiability formula $F$ with $n$ variables and clause density $\alpha$. Assume that the probability that $F$ is unsatisfiable is $O(1/\log(n)^{1+\e})$ for $\e>0$. We show that…

The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

We characterize the model spaces $K_\Theta$ in which functions with smooth boundary extensions are dense. It is shown that such approximations are possible if and only if the singular measure associated to the singular inner factor of…

Let $k\geq 2$ be an integer. In the spirit of Kolesnikov-Werner \cite{KW}, for each $j\in\{2,\ldots,k\}$, we conjecture a sharp Santal\'{o} type inequality (we call it $j$-Santal\'{o} conjecture) for many sets (or more generally for many…

We study the deterministic query complexity of Boolean functions on slices of the hypercube. The $k^{th}$ slice $\binom{[n]}{k}$ of the hypercube $\{0,1\}^n$ is the set of all $n$-bit strings with Hamming weight $k$. We show that there…

Let $S_{n,k}$ denote the random geometric graph obtained by placing points in a square box of area $n$ according to a Poisson process of intensity 1 and joining each point to its $k$ nearest neighbours. Balister, Bollob\'as, Sarkar and…

Bent functions are Boolean functions that are maximally nonlinear. They can be represented as bent squares, i.e., square matrices for which each row and each column is the Walsh spectrum of a Boolean function. Using this representation, it…

We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial time (by `good' we mean that violate a small fraction of clauses).…

A graph $G$ is called $H$-saturated if $G$ contains no copy of $H$, but $G+e$ contains a copy of $H$ for any edge $e\in E(\overline{G})$. The saturation number of $H$ is the minimum number of edges in an $H$-saturated graph of order $n$,…

Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…

Let $$ T(q)=\sum_{k=1}^\infty d(k) q^k, \quad |q|<1, $$ where $d(k)$ denotes the number of positive divisors of the natural number $k$. We present monotonicity properties of functions defined in terms of $T$. More specifically, we proved…