Search Results - Deterministic parallel complexity classes

Efficient deterministic MapReduce algorithms for parallelizable problems by Frei, Fabian, Wada, Koichi

“…The MapReduce framework has firmly established itself as one of the most widely used parallel computing platforms for processing big data on tera- and peta-byte scale…”
Get full text

Depth-first search in directed planar graphs, revisited by Allender, Eric, Chauhan, Archit, Datta, Samir

“…; the algorithm can be implemented in the complexity class AC 1 ( UL ∩ co-UL ) , which is contained in AC 2 . Prior…”
Get full text

Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions by Akavia, Adi

“… This strictly extends the class of compressible/Fourier sparse signals efficiently handled by previous deterministic algorithms for signals in C N…”
Get full text

Simulating counting oracles with cooperation by Leporati, Alberto, Manzoni, Luca, Mauri, Giancarlo, Porreca, Antonio E., Zandron, Claudio

“… ‖ # P , the complexity class of problems solved in polynomial time by deterministic Turing machines with a polynomial number of parallel queries to an oracle…”
Get full text

Parallel and deterministic algorithms from MRFs: surface reconstruction by Geiger, D., Girosi, F.

“… A parallel, iterative algorithm to solve the deterministic equations of the two models is presented, together with some experiments on synthetic and real images.< >…”
Get full text

DOOSRA—Distributed Object‐Oriented Software Restructuring Approach using DIM‐K‐means and MAD‐based ENRNN classifier by Sudhakar, G., Nithiyanandam, S.

“… Thus, utilising the Deterministic Initialisation Method based K‐Means (DIM‐K‐Means) and Median Absolute Deviation…”
Get full text

Deterministic quantum non-locality and graph colorings by Galliard, Viktor, Tapp, Alain, Wolf, Stefan

“… We discuss these parallels and study the class of graphs corresponding to the first two-party pseudo-telepathy game, proposed by Brassard, Cleve, and Tapp in 1999…”
Get full text

The Parallel Complexity of Graph Canonization Under Abelian Group Action by Arvind, V., Köbler, Johannes

“…We study the problem of computing canonical forms for graphs and hypergraphs under Abelian group action and show tight complexity bounds…”
Get full text

Optimal deterministic distributed algorithms for maximal independent set in geometric graphs by Molla, Anisur Rahaman, Pandit, Supantha, Roy, Sasanka

“… Researchers in this community are trying to close the time complexity gap of computing a MIS…”
Get full text

Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations by Novak, Antonin, Gnatowski, Andrzej, Sucha, Premysl

“…•Distributionally robust solution to total flow time minimization on parallel machines…”
Get full text

The P versus NP Problem from the Membrane Computing View by Pérez-Jiménez, Mario J.

“…In the last few decades several computing models using powerful tools from Nature have been developed (because of this, they are known as bio-inspired models)…”
Get full text

Parallel Communicating Finite Automata: Productiveness and Succinctness by Xie, Jingnan, Lin, Ching-Sheng, Hunt, Harry B.

“…Parallel Communicating Finite Automata (PCFA) extend classical finite automata by enabling multiple automata to operate in parallel and communicate upon request, capturing essential aspects of parallel and distributed computation…”
Get full text

Depth-two P systems can simulate Turing machines with NP oracles by 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…”
Get full text

Component stability in low-space massively parallel computation by Czumaj, Artur, Davies-Peck, Peter, Parter, Merav

“…In this paper, we study the power and limitations of component-stable algorithms in the low-space model of massively parallel computation ( MPC…”
Get full text

Tritium Dispersion Around the Angra Nuclear Power Plant: Boundary Simplification by Diffeomorph Conformal Transformations by Meneghetti, André, Bodmann, Bardo Ernst Josef, de Vilhena, Marco Tullio Menna Barreto

“…In this contribution, we present an efficient tool to attack a class of non-plane-parallel problems…”
Get full text

Parallel machine scheduling with high multiplicity by Clifford, John J., Posner, Marc E.

Get full text

Space-Efficient Deterministic Simulation of Probabilistic Automata by Macarie, Ioan I.

“…) and an input string x of length n, we ask how much space does a deterministic Turing machine need in order to decide the acceptance of the input string by that automaton…”
Get full text

Saturation and stability in the theory of computation over the reals by 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…”
Get full text

Scheduling in the Random-Order Model by Albers, Susanne, Janke, Maximilian

“… The goal is to assign a sequence of jobs to m identical parallel machines so as to minimize the maximum completion time of any job…”
Get full text

Complexity-theoretic aspects of expanding cellular automata by Modanese, Augusto

“… The respective polynomial-time complexity class is shown to coincide with ≤ tt p ( NP ) , that is, the class of decision problems polynomial-time truth-table reducible to problems in NP…”
Get full text