Skip to content

Author

B. Subercaseaux

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

The CNF Encoding Complexity of Boolean Functions

We study the minimum number of clauses required to encode a boolean function into a CNF formula with auxiliary variables. Our main result is that if a boolean function can be evaluated in nondeterministic time $t$ (in the RAM model) with $m$ bits of advice such that at most $b$ bits of advice are accessed for each inpu...

A. Krapivin, Benjamin Przybocki, B. Subercaseaux · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.