Results 21 to 30 of about 5,235,728 (202)
Counting self-dual monotone Boolean functions [PDF]
Journal of Integer Sequences, 2023 Zaprezentowano kilka algorytmów zliczających samodualne monotoniczne funkcje boolowskie.
Bartłomiej Pawelski +1 more
openaire +2 more sources
Any Monotone Function Is Realized by Interlocked Polygons
Algorithms, 2012 Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest.
Erik D. Demaine +2 more
doaj +1 more source
The monotone circuit complexity of boolean functions
Combinatorica, 1987 Some new results concerning lower bounds for the complexity of monotone circuits that detect cliques in graphs are obtained using modified versions of known methods. It is shown that even a very rough approximation of the maximum clique size of a graph, requires superpolynomial size of monotone circuits.
Noga Alon, Ravi B. Boppana
openaire +3 more sources
Monotone, Horn and Quadratic Pseudo-Boolean Functions [PDF]
J. Univers. Comput. Sci., 2000 JUCS - Journal of Universal Computer Science Volume Nr.
Foldes,Stephan, Hammer,Peter
openaire +2 more sources
Representations of Monotone Boolean Functions by Linear Programs [PDF]
ACM Transactions on Computation Theory, 2019 We introduce the notion of monotone linear programming circuits (MLP circuits), a model of computation for partial Boolean functions. Using this model, we prove the following results. 1 (1) MLP circuits are superpolynomially stronger than monotone Boolean circuits.
Mateus de Oliveira Oliveira +1 more
openaire +6 more sources
Penalized wavelet monotone regression [PDF]
, 2007 In this paper we focus on nonparametric estimation of a constrained regression function using penalized wavelet regression techniques. This results into a convex op- timization problem under linear constraints.
Irène Gijbels +5 more
core +1 more source
Blocks of Monotone Boolean Functions [PDF]
Computer Science and Information Technology, 2016 This paper first proposed the method of constructing blocks of monotone Boolean functions (MBFs) is developed for classification and the analysis of these functions. Use of only nonisomorphic blocks considerably simplifies enumeration MBFs. Application of the method of construction blocks on the example of classification and analysis of MBFs from 0 to ...
Tkachenco V.G., Sinyavsky O.V.
openaire +1 more source
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search [PDF]
, 2013 We present an optimal, combinatorial 1−1/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pál and Vondrák, 2008), our algorithm is extremely simple ...
Filmus, Yuval +3 more
core +1 more source
Probabilistic Computing via Gate‐Tunable Random Telegraph Noise
Advanced Science, EarlyView.Intrinsic random telegraph noise in metal–oxide–semiconductor field‐effect transistors is harnessed to create gate‐tunable probabilistic bits. By modulating carrier‐trapping dynamics, the device produces stochastic binary outputs with a continuous bias‐to‐probability transfer.
Gyungwon Yun +8 more
wiley +1 more source
The Number of Monotone and Self-Dual Boolean Functions [PDF]
Journal of Applied Mathematics, Statistics and Informatics, 2014 Abstract In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f.
Haviarova, L., Toman, E.
openaire +2 more sources