On randomized counting versus randomised decision
نویسنده
چکیده
We study the question of which counting problems admit f.p.r.a.s., under a structural complexity perspective. Since problems in #P with NP-complete decision version do not admit f.p.r.a.s. (unless NP = RP), we study subclasses of #P, having decision version either in P or in RP. We explore inclusions between these subclasses and we present all possible worlds with respect to NP v.s. RP and RP v.s. P.
منابع مشابه
Effectiveness Of Continuous Versus Pulsed Short-Wave Diathermy In The Management Of Knee Osteoarthritis: A Randomised Pilot Study
Background: Short-wave diathermy (SWD) is an electrotherapeutic modality used in the conservative treatment of knee osteoarthritis (KOA). Electromagnetic radiation delivered in continuous (cSWD) or pulse (pSWD) mode provides a deep heating effect on tissues. There is no consensus on outcomes of treatment with cSWD versus pSWD in KOA. The aim of this study was to compare the effects of cSWD ve...
متن کاملO-30: Novel Interventions to Reduce ReInfection in Women with Chlamydia: A Randomised-Controlled Trial
Background: To determine if postal testing kits (PTK) and patient delivered partner therapy (PDPT) for managing sexual partners of women with Chlamydia tracho-matis, reduce re-infection rates in women, compared to partner notification by patient referral. Materials and Methods: Three hundred and thirty women testing positive for chlamydia, at clinics for genitourinary medicine, family planning ...
متن کامل‘Decision support system (DSS) for prevention of cardiovascular disease (CVD) among hypertensive (HTN) patients in Andhra Pradesh, India’ – a cluster randomised community intervention trial
BACKGROUND Very few studies having decision support systems as an intervention report on patient outcomes for cardiovascular disease in the Western world. The potential role of decision support system for the management of blood pressure among Indian hypertensives remains unclear. We propose a cluster randomised trial that aims to test the effectiveness and cost effectiveness of DSS among India...
متن کاملApproximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
The paper studies effective approximate solutions to combinatorial counting and uniform generation problems. Using a technique based on the simulation of ergodic Markov chains, it is shown that, for self-reducible structures, almost uniform generation is possible in polynomial time provided only that randomised approximate counting to within some arbitrary polynomial factor is possible in polyn...
متن کاملExperimental Comparison of Classification Uncertainty for Randomised and Bayesian Decision Tree Ensembles
In this paper we experimentally compare the classification uncertainty of the randomised Decision Tree (DT) ensemble technique and the Bayesian DT technique with a restarting strategy on a synthetic dataset as well as on some datasets commonly used in the machine learning community. For quantitative evaluation of classification uncertainty, we use an Uncertainty Envelope dealing with the class ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.01901 شماره
صفحات -
تاریخ انتشار 2018