Complexity of restricted and unrestricted models of molecular computation
نویسنده
چکیده
In [9] and [2] a formal model for molecular computing was proposed, which makes focused use of affinity purification. The use of PCR was suggested to expand the range of feasible computations, resulting in a second model. In this note, we give a precise characterization of these two models in terms of recognized computational complexity classes, namely branching programs (BP) and nondeterministic branching programs (NBP ) respectively. This allows us to give upper and lower bounds on the complexity of desired computations. Examples are given of computable and uncomputable problems, given limited t ime.
منابع مشابه
Stochastic Restricted Two-Parameter Estimator in Linear Mixed Measurement Error Models
In this study, the stochastic restricted and unrestricted two-parameter estimators of fixed and random effects are investigated in the linear mixed measurement error models. For this purpose, the asymptotic properties and then the comparisons under the criterion of mean squared error matrix (MSEM) are derived. Furthermore, the proposed methods are used for estimating the biasing parameters. Fin...
متن کاملApplication of variational iteration method for solving singular two point boundary value problem
DEA methodology allows DMUs to select the weights freely, so in the optimalsolution we may see many zeros in the optimal weight. to overcome this prob-lem, there are some methods, but they are not suitable for evaluating DMUswith fuzzy data. In this paper, we propose a new method for solving fuzzyDEA models with restricted multipliers with less computation, and comparethis method with Liu''''''...
متن کاملPositive-Shrinkage and Pretest Estimation in Multiple Regression: A Monte Carlo Study with Applications
Consider a problem of predicting a response variable using a set of covariates in a linear regression model. If it is a priori known or suspected that a subset of the covariates do not significantly contribute to the overall fit of the model, a restricted model that excludes these covariates, may be sufficient. If, on the other hand, the subset provides useful information, shrinkage meth...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملNQP = co-C=P
Adleman, Demarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. It is known that, with restricted amplitudes, NQP is characterized in terms of the classical counting complexity class C=P. In this paper we prove that, with unrestricted amplitudes, NQP indeed coincides with the complement of C=P. As an immediate corollary, with unre...
متن کامل