Results 21 to 30 of about 1,698,061 (303)
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
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
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
Strengthening Model Checking Techniques with Inductive Invariants [PDF]
, 2009 This paper describes optimized techniques to efficiently compute and reap benefits from inductive invariants within SAT-based model checking. We address sequential circuit verification, and we consider both equivalences and implications between pairs of ...
Cabodi, Gianpiero +2 more
core +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
SRCLock: SAT-Resistant Cyclic Logic Locking for Protecting the Hardware [PDF]
ACM Great Lakes Symposium on VLSI, 2018 In this paper, we claim that cyclic obfuscation, when properly implemented, poses exponential complexity on SAT or CycSAT attack. The CycSAT, in order to generate the necessary cycle avoidance clauses, uses a pre-processing step.
Shervin Roshanisefat +2 more
semanticscholar +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
The Fractal Dimension of SAT Formulas [PDF]
, 2013 Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental testing process.
Ansótegui, C. +3 more
core +3 more sources