Search Results - Nondeterministic parallel complexity classes

Refine Results
  1. 1

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

    ISSN: 2196-1115
    Published: Springer 20.11.2021
    Published 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. 2

    Circuit Definitions of Nondeterministic Complexity Classes by Venkateswaran, H.

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1992
    Published 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. 3

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

    ISSN: 0168-0072
    Published: Elsevier B.V 31.08.1999
    Published 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. 4

    A CMOS-compatible oscillation-based VO2 Ising machine solver by 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

    ISSN: 2041-1723, 2041-1723
    Published: London Nature Publishing Group UK 18.04.2024
    Published 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. 5

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

    ISSN: 1432-4350, 1433-0490
    Published: New York Springer US 01.04.2023
    Published 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. 6

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

    ISSN: 2475-1421, 2475-1421
    Published: New York, NY, USA ACM 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. 7

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

    ISSN: 0022-0000, 1090-2724
    Published: Elsevier Inc 01.09.2016
    Published 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. 8

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

    ISSN: 0304-3975, 1879-2294
    Published: Amsterdam Elsevier B.V 01.03.2005
    Published 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. 9

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

    ISBN: 9780769531830, 0769531830
    ISSN: 1043-6871
    Published: IEEE 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. 10

    A communication hierarchy of parallel computations by Geffert, Viliam

    ISSN: 0304-3975, 1879-2294
    Published: Amsterdam Elsevier B.V 30.05.1998
    Published 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. 11

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

    ISSN: 0020-0255, 1872-6291
    Published: Elsevier Inc 01.10.2019
    Published 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. 12

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

    ISBN: 9781424472147, 1424472148
    ISSN: 1093-0159
    Published: IEEE 01.06.2010
    “…Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory…”
    Get full text
    Conference Proceeding
  13. 13

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

    ISSN: 0304-3975, 1879-2294
    Published: Amsterdam Elsevier B.V 17.04.1995
    Published 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. 14

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

    ISSN: 1206-212X, 1925-7074
    Published: Calgary Taylor & Francis 2007
    “…We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL…”
    Get full text
    Journal Article
  15. 15

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

    ISSN: 0304-3975, 1879-2294
    Published: Elsevier B.V 24.03.2022
    Published 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. 16

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

    ISSN: 1744-5760, 1744-5779
    Published: Taylor & Francis Group 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. 17

    CHARACTERIZATIONS OF PARALLEL COMPLEXITY CLASSES by VENKATESWARAN, H

    ISBN: 9798206164015
    Published: 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. 18

    Parallel real -time complexity theory by Bruda, Stefan Dinu

    ISBN: 0612693643, 9780612693647
    Published: 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. 19

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

    ISBN: 1088327184, 9781088327180
    Published: 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. 20

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

    ISBN: 9798557040983
    Published: 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