Search Results - Nondeterministic parallel complexity classes
-
1
Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce
ISSN: 2196-1115Published: Springer 20.11.2021Published in Journal of big data (20.11.2021)“… In this paper, we address the scalability issue encountered while deriving distinguishing sequences from complete observable nondeterministic finite state machines by introducing a massively parallel…”
Get full text
Journal Article -
2
Circuit Definitions of Nondeterministic Complexity Classes
ISSN: 0097-5397, 1095-7111Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1992Published in SIAM journal on computing (01.08.1992)“…This paper considers restrictions on Boolean circuits and uses them to obtain new uniform circuit characterizations of nondeterministic space and time classes…”
Get full text
Journal Article -
3
Saturation and stability in the theory of computation over the reals
ISSN: 0168-0072Published: Elsevier B.V 31.08.1999Published in Annals of pure and applied logic (31.08.1999)“… ? Some unclassical complexity classes arise naturally in the study of these questions. They are still open, but we could obtain unconditional results of independent interest…”
Get full text
Journal Article -
4
A CMOS-compatible oscillation-based VO2 Ising machine solver
ISSN: 2041-1723, 2041-1723Published: London Nature Publishing Group UK 18.04.2024Published in Nature communications (18.04.2024)“… belonging to the nondeterministic polynomial time complexity class using nanoscale vanadium-dioxide-based…”
Get full text
Journal Article -
5
Complexity Limitations on One-turn Quantum Refereed Games
ISSN: 1432-4350, 1433-0490Published: New York Springer US 01.04.2023Published in Theory of computing systems (01.04.2023)“… implementable joint measurement on the two states to determine which of the player wins. The complexity class QRG(1…”
Get full text
Journal Article -
6
A Robust Theory of Series Parallel Graphs
ISSN: 2475-1421, 2475-1421Published: New York, NY, USA ACM 09.01.2023Published in Proceedings of ACM on programming languages (09.01.2023)“…Motivated by distributed data processing applications, we introduce a class of labeled directed acyclic graphs constructed using sequential and parallel composition operations, and study automata and logics…”
Get full text
Journal Article -
7
A logical approach to locality in pictures languages
ISSN: 0022-0000, 1090-2724Published: Elsevier Inc 01.09.2016Published in Journal of computer and system sciences (01.09.2016)“…≥1 recognized in linear time on nondeterministic cellular automata, a robust complexity class that contains, for d…”
Get full text
Journal Article -
8
Ambiguous classes in μ -calculi hierarchies
ISSN: 0304-3975, 1879-2294Published: Amsterdam Elsevier B.V 01.03.2005Published in Theoretical computer science (01.03.2005)“… In the language of μ -calculi, this theorem asserts the equality between the complexity classes Σ 2 ∩ Π 2 and Comp ( Σ 1 , Π 1…”
Get full text
Journal Article Conference Proceeding -
9
Correctness of Multiplicative Additive Proof Structures is NL-Complete
ISBN: 9780769531830, 0769531830ISSN: 1043-6871Published: IEEE 01.06.2008Published in 2008 23rd Annual IEEE Symposium on Logic in Computer Science (01.06.2008)“…The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding…”
Get full text
Conference Proceeding -
10
A communication hierarchy of parallel computations
ISSN: 0304-3975, 1879-2294Published: Amsterdam Elsevier B.V 30.05.1998Published in Theoretical computer science (30.05.1998)“… We show that, though the underlying machine for the synchronized alternation is alternating, the nature of message broadcasting is nondeterministic…”
Get full text
Journal Article -
11
On solutions and representations of spiking neural P systems with rules on synapses
ISSN: 0020-0255, 1872-6291Published: Elsevier Inc 01.10.2019Published in Information sciences (01.10.2019)“…Spiking neural P systems, or SN P systems, are parallel and nondeterministic computing models inspired by spike processing of neurons…”
Get full text
Journal Article -
12
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
ISBN: 9781424472147, 1424472148ISSN: 1093-0159Published: IEEE 01.06.2010Published in 2010 IEEE 25th Annual Conference on Computational Complexity (01.06.2010)“…Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory…”
Get full text
Conference Proceeding -
13
Computing functions with parallel queries to NP
ISSN: 0304-3975, 1879-2294Published: Amsterdam Elsevier B.V 17.04.1995Published in Theoretical computer science (17.04.1995)“… = P, and that the equality of the classes FP log NP and FP ∥ NP would imply that the number of nondeterministic bits needed for the computation of any problem…”
Get full text
Journal Article -
14
Size Matters: Logarithmic Space is Real Time
ISSN: 1206-212X, 1925-7074Published: Calgary Taylor & Francis 2007Published in International journal of computers & applications (2007)“…We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL…”
Get full text
Journal Article -
15
Depth-two P systems can simulate Turing machines with NP oracles
ISSN: 0304-3975, 1879-2294Published: Elsevier B.V 24.03.2022Published in Theoretical computer science (24.03.2022)“…•This model uses evolution, communication, dissolution, and (weak) membrane division rules.•We prove that these P systems compute at least all problems in the complexity class…”
Get full text
Journal Article -
16
Computing with cells: membrane systems - some complexity issues
ISSN: 1744-5760, 1744-5779Published: Taylor & Francis Group 01.10.2008Published in International journal of parallel, emergent and distributed systems (01.10.2008)“… By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained…”
Get full text
Journal Article -
17
CHARACTERIZATIONS OF PARALLEL COMPLEXITY CLASSES
ISBN: 9798206164015Published: ProQuest Dissertations & Theses 01.01.1986“…) the two players' roles are completely symmetric. The new game is used to study the relationship between two natural parallel complexity classes, namely LOGCFL and AC('1…”
Get full text
Dissertation -
18
Parallel real -time complexity theory
ISBN: 0612693643, 9780612693647Published: ProQuest Dissertations & Theses 01.01.2002“…We present a new complexity theoretic approach to real-time computations. We define timed ω-languages as a new formal model for such computations…”
Get full text
Dissertation -
19
The Fine-Grained Complexity of Problems Expressible by First-Order Logic and Its Extensions
ISBN: 1088327184, 9781088327180Published: ProQuest Dissertations & Theses 01.01.2019“…This dissertation studies the fine-grained complexity of model checking problems for fixed logical formulas on sparse input…”
Get full text
Dissertation -
20
A Parallel Algorithm for Coloring the Vertices of a Graph
ISBN: 9798557040983Published: ProQuest Dissertations & Theses 01.01.2020“… It is one of the hardest problems in the nondeterministic polynomial time complexity class (NP…”
Get full text
Dissertation

