Weak lumpability in the k-SAT problem
نویسندگان
چکیده
منابع مشابه
A geometric invariant in weak lumpability of finite Markov chains
We consider weak lumpability of finite homogeneous Markov chains, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpability is equivalent to the existence of a direct sum of polyhedral cones which is is positively invariant by the transition probability matrix of the original chain. It allows us, i...
متن کاملOn Weak Lumpability of Denumerable Markov Chains
We consider weak lumpability of denumerable discrete or continuous time Markov chains. Firstly, we are concerned with irreducible recurrent positive and R-positive Markov chains evolving in discrete time. We study the properties of the set of all initial distributions of the starting chain leading to an aggregated homogeneous Markov chain with respect to a partition of the state space. In parti...
متن کاملWeak Lumpability of Finite Markov Chains and Positive Invariance of Cones
We consider weak lumpability of general nite homogeneous Markov chains evolving in discrete time, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpabilityis equivalent to the existence of a decomposable polyhedral cone which is positively invariant by the transition probability matrix of the origi...
متن کاملEvaluation of Serum Agglutination Test in the Diagnosis of Pediatric Brucellosis
Background & Aims: Brucellosis is a public health problem in many developing countries, including Iran. Diagnosis is based on history, clinical manifestations and positive serum agglutination test (SAT) or Wright test. The purpose of this study was to evaluate the diagnostic value of SAT in pediatric Brucellosis. Methods: In this prospective study, during 2 years, 52 patients with clinical feat...
متن کامل(2+ε)-Sat Is NP-hard
We prove the following hardness result for a natural promise variant of the classical CNFsatisfiability problem: Given a CNF-formula where each clause has width w and the guarantee that there exists an assignment satisfying at least g = d2 e − 1 literals in each clause, it is NP-hard to find a satisfying assignment to the formula (that sets at least one literal to true in each clause). On the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 13 شماره
صفحات -
تاریخ انتشار 2000