Results 21 to 30 of about 1,605,280 (279)
Boolean Satisfiability in Electronic Design Automation [PDF]
, 2000 Boolean Satisfiability (SAT) is often used as the underlying model for a significant and increasing number of applications in Electronic Design Automation (EDA) as well as in many other fields of Computer Science and Engineering. In recent years, new and
Marques-Silva, J. P., Sakallah, K. A.
core +3 more sources
Comparing the Clinical Spectrum of Paediatric In-patients in pre-COVID-19, during COVID19 and post-COVID-19 Pandemic Periods in a Tertiary Level Teaching Centre [PDF]
Journal of Clinical and Diagnostic ResearchIntroduction: Public awareness of the COVID-19 pandemic has resulted in a reduction in healthcare utilisation for other diseases. Understanding how the COVID-19 pandemic affects hospital admissions and the disease patterns is crucial for proper ...
Veena Anand +4 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
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
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
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder [PDF]
, 2019 Assuming the Unique Games Conjecture, we show that existing approximation algorithms for some Boolean Max-2-CSPs with cardinality constraints are optimal. In particular, we prove that Max-Cut with cardinality constraints is UG-hard to approximate within ~
Austrin, Per, Stankovic, Aleksa
core +2 more sources
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
On the van der Waerden numbers w(2;3,t) [PDF]
, 2014 We present results and conjectures on the van der Waerden numbers w(2;3,t) and on the new palindromic van der Waerden numbers pdw(2;3,t). We have computed the new number w(2;3,19) = 349, and we provide lower bounds for 20
Ahmed, Tanbir +2 more
core +2 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
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