This paper investigates the computational power of space-bounded quantum Turing machines. The following facts are proved for space-constructible space bounds s satisfying s(n) = Ω(log n). 1. Any quantum Turing machine (QTM) running in space s can be simulated by an unbounded error probabilistic Turing machine (PTM) running in space O(s). No assumptions on the probability of error or running tim...

Propositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter. There are different approaches to reasoning that are captured by corresponding proof systems, each with its own strengths and weaknesses and need for resources. The simplest an...

This study investigated the relationship between main dimensions in the strategy-making process, environmental complexity, and performance in pharmaceutical companies of Iran. Results argue that pharmaceutical companies like other industries place differing emphasis on strategy-making and employ different modes of strategy-making. It offers a typology of different modes of strategy-making that ...

introduction: in this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. epilepsy is considered as a dynamical change in nonlinear and complex brain system. the ability of the proposed measure for characterizing the normal and epileptic eeg signals when the signal is short or is...

This study investigated the relationship between main dimensions in the strategy-making process, environmental complexity, and performance in pharmaceutical companies of Iran. Results argue that pharmaceutical companies like other industries place differing emphasis on strategy-making and employ different modes of strategy-making. It offers a typology of different modes of strategy-making that ...

Abstract We review the space complexity of deterministically exploring undirected graphs. assume that vertices are indistinguishable and edges have a locally unique color guides traversal space-constrained agent. The graph is considered to be explored once agent has visited all vertices. visit results for this setting showing $$\varTheta \,(\log n)$$ <mml:math xmlns:mml="http://www.w3.org/1998/...