3 papers
cs.CC2026
The Unit Gap: How Sharing Works in Boolean Circuits
Kirill Krinkin
We study the gap between the minimum size of a Boolean circuit (DAG) and the minimum size of a formula (tree circuit) over the And-Inverter Graph (AIG) basis {AND, NOT} with free i…
cs.CC2026
A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation
Kirill Krinkin
The observation that optimum circuit size changes by at most under a one-point truth table perturbation is implicit in prior work on the Minimum Circuit Size Problem. This n…
cs.RO2026
Equivalence and Divergence of Bayesian Log-Odds and Dempster's Combination Rule for 2D Occupancy Grids
Tatiana Berlenko, Kirill Krinkin
We introduce a pignistic-transform-based methodology for fair comparison of Bayesian log-odds and Dempster's combination rule in occupancy grid mapping, matching per-observation de…