Related papers: Nondeterministic unitary OBDDs
Reliable uncertainty from deterministic single-forward pass models is sought after because conventional methods of uncertainty quantification are computationally expensive. We take two complex single-forward-pass uncertainty approaches, DUQ…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
Comparing Bayesian neural networks (BNNs) with different widths is challenging because, as the width increases, multiple model properties change simultaneously, and, inference in the finite-width case is intractable. In this work, we…
A recently introduced measure of Boolean functions complexity--disjunc\-tive complexity (DC)--is compared with other complexity measures: the space complexity of streaming algorithms and the complexity of nondeterministic branching programs…
We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…
A set of novel approaches for estimating epistemic uncertainty in deep neural networks with a single forward pass has recently emerged as a valid alternative to Bayesian Neural Networks. On the premise of informative representations, these…
We consider Bergman spaces and variations of them in one or several complex variables. For some domains we show that in these spaces the generic function is totally unbounded and hence non - extendable. We also show that the generic…
Decision \textsc{dnnf} (a.k.a. $\wedge_d$-\textsc{fbdd}) is an important special case of Decomposable Negation Normal Form (\textsc{dnnf}), a landmark knowledge compilation model. Like other known \textsc{dnnf} restrictions, Decision…
A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…
We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly…
We explore a definition of uniformity on noncompact manifolds that does not require a Riemannian metric, but is equivalent to bounded gemetry. These are unfinished research notes (and will likely never be published), but since they were…
In this paper we classify some special reducts of the countable atomless Boolean algebra which we call functional reducts. We prove that there are exactly $13$ such structures up to first order interdefinability.
An iterated uniform finite-state transducer (IUFST) runs the same length-preserving transduction, starting with a sweep on the input string and then iteratively sweeping on the output of the previous sweep. The IUFST accepts the input…
We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.
In this paper, we study nonlinear differential equations satisfied by the generating function of Boole numbers. In addition, we derive some explicit and new interesting identities involving Boole numbers and higher-order numbers arising…
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
In the present paper we shall establish n-dimensional Hardy's inequalities with non-doubling weight functions of the distance to the boundary, where the boundary is a $C^2$ class bounded domain of $R^N$. This work is essentially based on…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…