Results 21 to 30 of about 235,564 (296)
A better algorithm for random k-SAT [PDF]
, 2009 Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high probability for constraint densities m/n < (1 − εk)2k ln(k)/k, where εk → 0 ...
Coja-Oghlan, Amin, Amin Coja-Oghlan
core +1 more source
Using Volunteer Computing to Study Some Features of Diagonal Latin Squares
Open Engineering, 2017 In this research, the study concerns around several features of diagonal Latin squares (DLSs) of small order. Authors of the study suggest an algorithm for computing minimal and maximal numbers of transversals of DLSs.
Vatutin Eduard +3 more
doaj +1 more source
Generation of Synchronizing State Machines from a Transition System: A Region–Based Approach
International Journal of Applied Mathematics and Computer Science, 2023 Transition systems (TSs) and Petri nets (PNs) are important models of computation ubiquitous in formal methods for modeling systems. A crucial problem is how to extract, from a given TS, a PN whose reachability graph is equivalent (with a suitable notion
Teren Viktor +2 more
doaj +1 more source
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henry A. Kautz, Bart Selman
openaire +1 more source
Solving equations over small unary algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We consider the problem of solving a system of polynomial equations over fixed algebra $A$ which we call MPolSat($A$). We restrict ourselves to unary algebras and give a partial characterization of complexity of MPolSat($A$). We isolate a preorder $P(A)$
Przemyslaw Broniek
doaj +1 more source
, 2016 Branch decomposition is a prominent method for structurally decomposing a graph, hypergraph or CNF formula. The width of a branch decomposition provides a measure of how well the object is decomposed.
Ordyniak, Sebastian +2 more
core +4 more sources
Journal of Pure and Applied Microbiology, 2018 The clinical pathogenic strains of S. dysenteriae in this study were initially diagnosed as enteroinvasive E. coli due to the high similarity in characterization and pathogenic mechanism.
Nagham Sh. Alattar +2 more
doaj +1 more source
Why almost all satisfiable $k$-CNF formulas are easy [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform distribution over satisfiable $k$-CNF formulas with a linear number of clauses (clause-variable ...
Amin Coja-Oghlan +2 more
doaj +1 more source
CEUR Workshop Proceedings, 2016 In this short paper, we describe QBF solvers from the latest QBFEval that were based on the SAT-To-SAT solver. We present the main ideas behind the solvers and discuss their strengths and weaknesses.
Janhunen Tomi +2 more
openaire +6 more sources
National Journal of Physiology, Pharmacy and Pharmacology, 2023 Background: Female sterilization is the most accepted method of contraception in India. Almost 5–6 million female sterilization procedures are performed annually contributing to 98% of all sterilizations and roughly 62% of all contraceptive use. Although,
Mayadevi Brahmanandan +2 more
doaj +1 more source