Results 11 to 20 of about 1,600,173 (280)
Combinatorics, Probability and Computing, 2023 AbstractIn this paper we study a variation of the random $k$ -SAT problem, called polarised random $k$ -SAT, which contains both the classical random $k$ -SAT model and the random version of monotone $k$ -SAT another well-known NP-complete version of SAT.
Joel Larsson Danielsson, Klas Markström
openaire +3 more sources
Le identità transgender tra espressioni e vincoli dei corpi. L’autodeterminazione nell’approccio medicalizzato alla transizione [PDF]
S&F_scienzaefilosofia.it, 2020 Trangender identities between body’s expression and constrictions. Self-determination in medicalized gender transition Trans identities, through their non-conforming bodies, undermine a natural order based on the correspondence between sex and gender ...
GIARDINA, GIULIA, ZABONATI, ANNALISA
doaj
The relationship between frailty and social participation: focus on subjective health
BMC Research Notes, 2023 Objective Active participation of the older adults in the society is crucial; however, frailty prevents social participation. Meanwhile, many older adults participate daily in social activities, even with frailty. This study aims to examine whether older
Yuho Shimizu +3 more
doaj +1 more source
Linear time algorithm for quantum 2SAT [PDF]
, 2016 A canonical result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, we are given a family of 2-qubit projectors $\Pi_{ij}$ on a system of $n ...
Arad, Itai +3 more
core +2 more sources
LSTM-ANN based DTC of Induction Motor with 5 Level Inverter [PDF]
E3S Web of ConferencesMedium voltage drives especially induction motor drives are mostly using in industries for many applications. The precious intelligent control of induction motors are high required in nuclear power generation units.
Singh Satendra +3 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
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