Results 51 to 60 of about 133,438 (232)
A Relation between the Protocol Partition Number and the Quasi-Additive Bound [PDF]
, 2010 In this note, we show that the linear programming for computing the quasi-additive bound of the formula size of a Boolean function presented by Ueno [MFCS'10] is equivalent to the dual problem of the linear programming relaxation of an integer ...
Kamiyama, Naoyuki
core
, 2019 In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known deterministic ...
A Ambainis +23 more
core +1 more source
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 +5 more sources
A Novel Minimization Method for Sensor Deployment Via Heuristic 2-Sat Solution
Sir Syed University Research Journal of Engineering and Technology, 2018 The tasks of guard placement or sensor deployment in an art gallery, a museum or in the corridors of public and security buildings pose the same problem, which requires placing the guards or sensors so as to cover a specified set of nodes with a minimum
Waleed Ahmed, Ali Muhammad Ali Rushdi
doaj
From (Quantified) Boolean Formulas to Answer Set Programming [PDF]
, 2007 We propose in this article a translation from Quantified Boolean Formulae to Answer Set Programming. The computation of a solution of a Quantified Boolean Formula is then equivalent to the computation of a stable model for a normal logic program.
B. Da Mota, I. Stéphan, P. Nicolas
core +1 more source
Verification of Boolean programs with unbounded thread creation
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cook, B, Kroening, D, Sharygina, N
openaire +2 more sources
On the Study of the n-dimensional Boolean Cube in the Undergraduate Programs in Computer Science [PDF]
, 2021 Valentin Bakoev
openalex +1 more source
Satisfiability-Based Algorithms for Boolean Optimization
, 2004 This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering.
Manquinho, V., Marques-Silva, J. P.
core +2 more sources
On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero [PDF]
Computer Science Journal of Moldova, 2006 We consider a multi-criterion Boolean programming problem with partial criteria of the kind MIN MODUL of linear functions. We investigate such type of stability which can be understood as a discrete analogue of the Hausdorff lower semi-continuity.
Vladimir A. Emelichev +1 more
doaj