Výsledky vyhledávání - Nondeterministic parallel complexity classes

Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce Autor Elghadyry, Bilal, Ouardi, Faissal, Lotfi, Zineb, Verel, Sébastien

“… 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…”
Získat plný text

Circuit Definitions of Nondeterministic Complexity Classes Autor Venkateswaran, H.

“…This paper considers restrictions on Boolean circuits and uses them to obtain new uniform circuit characterizations of nondeterministic space and time classes…”
Získat plný text

Saturation and stability in the theory of computation over the reals Autor Chapuis, Olivier, Koiran, Pascal

“… ? 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…”
Získat plný text

A CMOS-compatible oscillation-based VO2 Ising machine solver Autor Maher, Olivier, Jiménez, Manuel, Delacour, Corentin, Harnack, Nele, Núñez, Juan, Avedillo, María J., Linares-Barranco, Bernabé, Todri-Sanial, Aida, Indiveri, Giacomo, Karg, Siegfried

“… belonging to the nondeterministic polynomial time complexity class using nanoscale vanadium-dioxide-based…”
Získat plný text

Complexity Limitations on One-turn Quantum Refereed Games Autor Ghosh, Soumik, Watrous, John

“… implementable joint measurement on the two states to determine which of the player wins. The complexity class QRG(1…”
Získat plný text

A Robust Theory of Series Parallel Graphs Autor Alur, Rajeev, Stanford, Caleb, Watson, Christopher

“…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…”
Získat plný text

A logical approach to locality in pictures languages Autor Grandjean, Etienne, Olive, Frédéric

“…≥1 recognized in linear time on nondeterministic cellular automata, a robust complexity class that contains, for d…”
Získat plný text

Ambiguous classes in μ -calculi hierarchies Autor Santocanale, Luigi, Arnold, André

“… In the language of μ -calculi, this theorem asserts the equality between the complexity classes Σ 2 ∩ Π 2 and Comp ( Σ 1 , Π 1…”
Získat plný text

Correctness of Multiplicative Additive Proof Structures is NL-Complete Autor de Naurois, P.J., Mogbil, V.

“…The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding…”
Získat plný text

A communication hierarchy of parallel computations Autor Geffert, Viliam

“… We show that, though the underlying machine for the synchronized alternation is alternating, the nature of message broadcasting is nondeterministic…”
Získat plný text

On solutions and representations of spiking neural P systems with rules on synapses Autor Cabarle, Francis George C., de la Cruz, Ren Tristan A., Cailipan, Dionne Peter P., Zhang, Defu, Liu, Xiangrong, Zeng, Xiangxiang

“…Spiking neural P systems, or SN P systems, are parallel and nondeterministic computing models inspired by spike processing of neurons…”
Získat plný text

A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources Autor Stolee, Derrick, Bourke, Chris, Vinodchandran, N V

“…Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory…”
Získat plný text

Computing functions with parallel queries to NP Autor Jenner, Birgit, Torán, Jacobo

“… = 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…”
Získat plný text

Size Matters: Logarithmic Space is Real Time Autor Bruda, S.D., Akl, S.G.

“…We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL…”
Získat plný text

Depth-two P systems can simulate Turing machines with NP oracles Autor Leporati, Alberto, Manzoni, Luca, Mauri, Giancarlo, Zandron, Claudio

“…•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…”
Získat plný text

Computing with cells: membrane systems - some complexity issues Autor Ibarra, Oscar H., Păun, Andrei

“… By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained…”
Získat plný text

CHARACTERIZATIONS OF PARALLEL COMPLEXITY CLASSES Autor VENKATESWARAN, H

“…) 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…”
Získat plný text

Parallel real -time complexity theory Autor Bruda, Stefan Dinu

“…We present a new complexity theoretic approach to real-time computations. We define timed ω-languages as a new formal model for such computations…”
Získat plný text

The Fine-Grained Complexity of Problems Expressible by First-Order Logic and Its Extensions Autor Gao, Jiawei

“…This dissertation studies the fine-grained complexity of model checking problems for fixed logical formulas on sparse input…”
Získat plný text

A Parallel Algorithm for Coloring the Vertices of a Graph Autor Narvik, Azman Sadeque

“… It is one of the hardest problems in the nondeterministic polynomial time complexity class (NP…”
Získat plný text