Results 1 to 10 of about 1,097 (101)
DSPACE(n)=?NSPACE(n): a degree theoretic characterization [PDF]
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, 1997 AbstractIt is shown that the following are equivalent. 1. DSPACE(n)=NSPACE(n). 2. There is a nontrivial ⩽1−NLm-degree that coincides with a ⩽1−Lm-degree. 3. For every class C closed under log-lin reductions, the ⩽1−NLm-complete degree of C coincides with the ⩽1−Lm-complete degree of C.
Manindra Agrawal
semanticscholar +4 more sources
All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model [PDF]
International Symposium on Mathematical Foundations of Computer Science, 2010 This work focuses on the computational power of the Mediated Population Protocol model on complete communication graphs and initially identical edges (SMPP). In particular, we investigate the class MPS of all predicates that are stably computable by the SMPP model. It is already known that MPS is in the symmetric subclass of NSPACE(n2).
CHATZIGIANNAKIS, IOANNIS +4 more
semanticscholar +4 more sources
A note on NSPACE ($\log _2 n$) and substitution [PDF]
RAIRO. Informatique théorique, 1977 S. Greibach
semanticscholar +4 more sources
Running Time Analysis of Broadcast Consensus Protocols [PDF]
Foundations of Software Science and Computation Structures24th International Conference, 2021 Broadcast consensus protocols (BCPs) are a model of computation, in which anonymous, identical, finite-state agents compute by sending/receiving global broadcasts.
Czerner P, Jaax S.
europepmc +3 more sources
Solutions of Word Equations Over Partially Commutative Structures [PDF]
International Colloquium on Automata, Languages and Programming, 2016 We give NSPACE(n log n) algorithms solving the following decision problems. Satisfiability: Is the given equation over a free partially commutative monoid with involution (resp. a free partially commutative group) solvable?
V. Diekert +2 more
semanticscholar +5 more sources
Leaders of neuronal cultures in a quorum percolation model. [PDF]
Front Comput Neurosci, 2010 We present a theoretical framework using quorum-percolation for describing the initiation of activity in a neural culture. The cultures are modeled as random graphs, whose nodes are excitatory neurons with kin inputs and kout outputs, and whose input ...
Eckmann JP +4 more
europepmc +6 more sources
Regular Realizability Problems and Context-Free Languages
Workshop on Descriptional Complexity of Formal Systems, 2015 We investigate regular realizability (RR) problems, which are the problems of verifying whether the intersection of a regular language – the input of the problem – and a fixed language, called a filter, is non-empty. In this paper we focus on the case of
A. Rubtsov, M. Vyalyi
semanticscholar +3 more sources
Application of artificial intelligence in medical education: focus on the application of ChatGPT for clinical medical education [PDF]
Journal of Medicine and Life Science, 2023 This study explores the potential use of artificial intelligence (AI)-based services, specifically ChatGPT-3.5, in medical education. The application of this technology is acknowledged as a valuable tool for simulating authentic clinical scenarios and ...
Hyeonmi Hong +3 more
doaj +1 more source
Communicative & Integrative Biology, 2023 Cellular measurement is a crucial faculty in living systems, and exaptations are acknowledged as a significant source of evolutionary innovation.
William B. Miller
doaj +1 more source
A Study on $f$-Rectifying Curves in Euclidean $n$-Space
Universal Journal of Mathematics and Applications, 2021 A rectifying curve in the Euclidean $n$-space $\mathbb{E}^n$ is defined as an arc-length parametrized curve $\gamma$ in $\mathbb{E}^n$ such that its position vector always lies in its rectifying space (i.e., the orthogonal complement of its principal ...
Zafar Iqbal, Joydeep Sengupta
doaj +1 more source