Searcharxiv⌕ Search

arXiv subjects

Fabio Dias

Publications and source records attributed to Fabio Dias.

3 recordsLinked to original sources

A Las Vegas algorithm for satisfiable SAT formulas, with an application to timetabling

Many scheduling problems need many different feasible timetables, and a view of how much freedom each event has. We study a Las Vegas algorithm that samples satisfying assignments of a Boolean formula one variable at a time: it draws each value from an estimate of its conditional probability, propagates, and restarts on a contradiction. Every output is a checked solution and comes with the exact probability of producing it. We prove that a run succeeds with probability at least $2^{-K}$, where $K$ is the expected Kullback--Leibler divergence between the true and estimated conditional probabilities along the run of a uniform solution. We also bound the distance of the outputs from uniform from the samples alone; it is a divergence in the opposite direction to $K$, so a sampler can succeed more often while being farther from uniform. On generated timetabling instances counted exactly, belief propagation on the timetabling problem brings $K$ to at most about one bit, and the estimated counts are within 2% of the exact ones. On a real university instance of the International Timetabling Competition 2019, rerunning only the failed runs delivered all 72 requested timetables with each of two estimators. Belief propagation succeeds in 31% of runs. Steered by a Markov chain that carries a nearly feasible timetable, it succeeds in 65% of runs, with outputs at least 300 bits from uniform. There the importance weights are too uneven to estimate the number of timetables, and we certify a lower bound instead. For random 3-SAT, an estimator whose $K$ grows logarithmically would give a polynomial-time Las Vegas algorithm beyond the densities at which any algorithm is proved to succeed; we conjecture that one exists below the satisfiability threshold.

math.GM↗

Limits and Constants of OpenAI's Claimed ETH Refutation

A recent OpenAI preprint claims a deterministic algorithm that counts the satisfying assignments of a $k$-CNF formula in time $2^{O_k(n\log\log n/\sqrt{\log n})}$, and $2^{O(n/\sqrt{\log n})}$ at bounded clause density, which would refute the Exponential Time Hypothesis. The headline bound is proved by tensor contraction; the body develops an interpolation algorithm with the weaker exponent $n(\log\log n)^2/\sqrt{\log n}$. This note does four things. First, it explains the interpolation algorithm in plain terms. Second, it asks how large $n$ must be for the bounds to bite. The preprint states no constants, so we treat the hidden constant $C$ as a parameter: the general bound beats the $2^n$ of brute force only beyond $n\approx 10^{32}$ for $C=2$, $10^{126}$ for $C=3$ and $10^{3517}$ for $C=10$. We then extract the constants from the tensor-contraction proof: for every input with $m$ clauses at bounded density, the running time it certifies stays above $2^n$ unless $\log_2(n+m)>10^9$, and on random 3-CNF at the satisfiability threshold unless $\log_2 n>5\times10^{11}$. So the bounds are subexponential as $n\to\infty$, but the proof certifies no speed-up over brute force for any input of bounded density that could ever be written down. Third, for the clause-product form of the interpolation algorithm we prove limits in a cost model matching the preprint's evaluation. By a short algebraic lemma, polynomial cost needs components of $O(\log^3 n)$ variables with per-point evaluation, or primal treewidth $O(\log^2 n)$ with dynamic programming over the groups. So the scheme costs $2^{Ω(\sqrt{\mathrm{tw}})}$ at treewidth $\mathrm{tw}$, $2^{Ω(\sqrt n)}$ with high probability on random 3-CNF above clause density 3, and $2^{Ω(n^{1/3})}$ even on trivially countable path formulas. We explain why the preprint's sharper routes escape these limits. Fourth, we report experiments.

cs.CC↗

Dimensional operators for mathematical morphology on simplicial complexes

In this work we study the framework of mathematical morphology on simplicial complex spaces. Simplicial complexes are widely used to represent multidimensional data, such as meshes, that are two dimensional complexes, or graphs, that can be interpreted as one dimensional complexes. Mathematical morphology is one of the most powerful frameworks for image processing, including the processing of digital structures, and is heavily used for many applications. However, mathematical morphology operators on simplicial complex spaces is not a concept fully developed in the literature. Specifically, we explore properties of the dimensional operators, small, versatile operators that can be used to define new operators on simplicial complexes, while maintaining properties from mathematical morphology. These operators can also be used to recover many morphological operators from the literature. Matlab code and additional material, including the proofs of the original properties, are freely available at \url{https://code.google.com/p/math-morpho-simplicial-complexes.}

cs.DM↗