Výsledky vyhledávání - "Parallel time complexity"

On parallel time in population protocols

Autoři: Czumaj, Artur Lingas, Andrzej

Zdroj: Information Processing Letters; 179, no 106314 (2023) ; ISSN: 0020-0190

Témata: Computer Sciences, Directed acyclic graph, Distributed computing, Parallel time complexity, Population protocols, Randomized algorithms

Relation: http://dx.doi.org/10.1016/j.ipl.2022.106314; scopus:85137172550

Dostupnost: https://lup.lub.lu.se/record/ed795015-53a7-4199-abfe-66ffbc1727e6
https://doi.org/10.1016/j.ipl.2022.106314

Oracle computations in parallel numerical linear algebra

Autoři: B. CODENOTTI LEONCINI, Mauro G. RESTA a další

Přispěvatelé: B. CODENOTTI LEONCINI, Mauro G. RESTA a další

Zdroj: Theoretical Computer Science. 127:99-121

Témata: Other matrix algorithms, parallel algorithms, reduction algorithms, parallel-time complexity, Parallel numerical computation, 0102 computer and information sciences, 02 engineering and technology, reducibility, models of computation, parallel linear algebraic algorithms, 01 natural sciences, Theoretical Computer Science, Complexity and performance of numerical algorithms, oracle computations, 0202 electrical engineering, electronic engineering, information engineering, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/567718
https://doi.org/10.1016/0304-3975(94)90102-3
https://core.ac.uk/display/53966556
https://dblp.uni-trier.de/db/journals/tcs/tcs127.html#CodenottiLR94
https://www.sciencedirect.com/science/article/pii/0304397594901023
https://www.sciencedirect.com/science/article/abs/pii/0304397594901023
https://hdl.handle.net/11380/454049

On the Intrinsic Complexity of Elimination Theory: On the intrinsic complexity of elimination theory

Autoři: Jacques Morgenstern Joos Heintz

Zdroj: Journal of Complexity. 9:471-498

Témata: Statistics and Probability, Numerical Analysis, Algebra and Number Theory, Control and Optimization, straight-line programs, Analysis of algorithms and problem complexity, Applied Mathematics, 0102 computer and information sciences, Gröbner bases, other bases for ideals and modules (e.g., Janet and border bases), Symbolic computation and algebraic computation, 01 natural sciences, parallel time complexity, 0101 mathematics, elimination theory

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/614377
https://doi.org/10.1006/jcom.1993.1031

Reversal Complexity: Reversal complexity

Autoři: Chen, Jian-Er Yap, Chee-Keng

Zdroj: SIAM Journal on Computing. 20:622-638

Témata: reversal hierarchies, parallel time complexity, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), complete languages, 01 natural sciences, tape reduction theorem

Popis souboru: application/xml

Parallel computation and conflicts in memory access

Autoři: Luděk Kučera

Zdroj: Information Processing Letters. 14:93-96

Témata: graph algorithms, parallel time complexity, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, model of computation, conflict-resolution rules in an idealized concurrent environment, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, parallel computation, 01 natural sciences, parallel RAM, Theory of operating systems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3786132
https://doi.org/10.1016/0020-0190(82)90093-x

Parallel complexity of logical query programs

Autoři: Jeffrey D. Ullman Allen Van Gelder

Zdroj: Algorithmica. 3:5-42

Témata: polynomial fringe, generalized sequential machine, chain program, Analysis of algorithms and problem complexity, 05 social sciences, 0102 computer and information sciences, logic programs without function symbols, 01 natural sciences, Theory of operating systems, Information storage and retrieval of data, parallel time complexity, \({\mathcal N}{\mathcal C}\), logical query programs, Datalog programs, 0501 psychology and cognitive sciences, PRAM algorithm, context-free language, Theorem proving (deduction, resolution, etc.)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/4055048
https://doi.org/10.1007/bf01762108
http://doi.org/10.1007/BF01762108
https://link.springer.com/10.1007/BF01762108
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica3.html#UllmanG88
https://doi.org/10.1007/BF01762108
https://link.springer.com/article/10.1007/BF01762108
https://ieeexplore.ieee.org/document/4568236/
https://www.computer.org/csdl/proceedings-article/focs/1986/542800438/12OmNB0FxiZ
https://dblp.uni-trier.de/db/conf/focs/focs86.html#UllmanG86
http://ieeexplore.ieee.org/document/4568236/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004568236
https://link.springer.com/article/10.1007/BF01762108

Simulation of Parallel Random Access Machines by Circuits: Simulation of parallell random access machines by circuits

Autoři: Uzi Vishkin Larry J. Stockmeyer

Zdroj: SIAM Journal on Computing. 13:409-422

Témata: complexity measures, computational power, combinational circuits, alternating Turing machines, parallel time complexity, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, 0102 computer and information sciences, Models of computation (Turing machines, etc.), synchronous parallelism, 01 natural sciences, circuit complexity, parallel RAM

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3846874
https://doi.org/10.1137/0213027

Computational Efficiency of Intermolecular Gene Assembly

Autoři: Ishdorj, T-O. Loos, R. Petre, I.

Zdroj: Annales Societatis Mathematicae Polonae. Series 4: Fundamenta Informaticae.

Témata: parallel time complexity, nondeterminism, gene assembly in ciliates

Přístupová URL adresa: http://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-article-BUS5-0015-0079

Erratum and addendum to: parallel computation and conflicts in memory access

Autoři: Luděk Kučera

Zdroj: Information Processing Letters. 17:107

Témata: graph algorithms, parallel time complexity, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, model of computation, conflict-resolution rules in an idealized concurrent environment, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, parallel computation, 01 natural sciences, parallel RAM, Theory of operating systems

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0020019083900807