Results 51 to 60 of about 4,855,672 (239)
Quantum Zero-Error Algorithms Cannot be Composed [PDF]
, 2002 We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed. In
Buhrman, Harry, de Wolf, Ronald
core +4 more sources
Efficient reduction of nondeterministic automata with application to language inclusion testing [PDF]
Logical Methods in Computer Science, 2019 We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages.
Lorenzo Clemente, Richard Mayr
doaj +1 more source
Pebbling, Entropy and Branching Program Size Lower Bounds [PDF]
, 2013 We contribute to the program of proving lower bounds on the size of branching programs solving the Tree Evaluation Problem introduced by Cook et. al. (2012).
Komarath, Balagopal, N, Jayalal Sarma M.
core +4 more sources
Controllable testing from nondeterministic finite state machines with multiple ports [PDF]
, 2011 Copyright @ 2011 IEEESome systems have physically distributed interfaces, called ports, at which they interact with their environment. We place a tester at each port and if the testers cannot directly communicate and there is no global clock then we are ...
Hierons, RM
core +1 more source
Alternation-Trading Proofs, Linear Programming, and Lower Bounds [PDF]
, 2010 A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models.
Williams, Ryan
core +6 more sources
Byzantine Fault Tolerance for Nondeterministic Applications
, 2007 All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency.
Zhao, Wenbing
core +4 more sources
Reducing Nondeterministic Tree Automata by Adding Transitions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We introduce saturation of nondeterministic tree automata, a technique that consists of adding new transitions to an automaton while preserving its language.
Ricardo Manuel de Oliveira Almeida
doaj +1 more source
Complexity, 2020 This paper investigates access link control and resource allocation for the device-to-device (D2D) communication in the fifth generation (5G) cellular networks.
Ning Du +3 more
doaj +1 more source
The language of certain conflicts of a nondeterministic process [PDF]
, 2010 The language of certain conflicts is the most general set of behaviours of a nondeterministic process, which certainly lead to a livelock or deadlock when accepted by another process running in parallel.
Malik, Robi
core +1 more source
ICT Express, 2018 Task scheduling is one of the most important issues in heterogeneous environments when high efficiency is required. Because task scheduling is a Nondeterministic Polynomial (NP)-hard problem, many evolutionary algorithms have been adopted to solve this ...
Negar Dordaie, Nima Jafari Navimipour
doaj +1 more source