Suchergebnisse - parallel complexity classes

Equivalence classes and conditional hardness in massively parallel computations

Autoren: Na Nongkai, Danupon Scquizzato, M.

Quelle: Distributed computing. 35(2):165-183

Schlagwörter: Conditional hardness, Fine-grained complexity, Massively Parallel Computation, Complex networks, Computational complexity, Data handling, Graph theory, Complexity class, Fine grained, Large-scale data processing, Low bound, Massively parallels, Parallel Computation, Parallel computation model, Equivalence classes

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-319607
https://doi.org/10.1007/s00446-021-00418-2

Logics Which Capture Complexity Classes Over the Reals

Autoren: Cucker, Felipe Meer, Klaus

Quelle: The Journal of Symbolic Logic, 1999 Mar 01. 64(1), 363-390.

Zugangs-URL: https://www.jstor.org/stable/2586770

A new pebble game that characterizes parallel complexity classes

Autoren: H. Venkateswaran Martin Tompa

Quelle: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). :348-360

Schlagwörter: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, parallel complexity, pebbling alternation, 0102 computer and information sciences, 02 engineering and technology, LOGCFL, Circuits, networks, 01 natural sciences, 2-person games, \(AC^ k\)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4112020
https://doi.org/10.1137/0218036
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp18.html#VenkateswaranT89
https://epubs.siam.org/doi/abs/10.1137/0218036
https://doi.org/10.1137/0218036
https://ieeexplore.ieee.org/document/4568226/
http://ieeexplore.ieee.org/document/4568226/
https://dblp.uni-trier.de/db/conf/focs/focs86.html#VenkateswaranT86
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004568226

The parallel complexity of finite-state automata problems

Autoren: Sang Cho Dung T. Huynh

Quelle: Information and Computation. 97:1-22

Schlagwörter: parallel complexity classes, degree of ambiguity, Complexity of computation (including implicit computational complexity), minimization problem, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, equivalence problems, Theoretical Computer Science, Computer Science Applications, Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Information Systems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/37178
https://doi.org/10.1016/0890-5401(92)90002-w
https://api.elsevier.com/content/article/PII:089054019290002W?httpAccept=text/xml
https://dblp.uni-trier.de/db/journals/iandc/iandc97.html#ChoH92
https://www.sciencedirect.com/science/article/pii/089054019290002W
https://www.sciencedirect.com/science/article/abs/pii/089054019290002W
https://dl.acm.org/doi/10.5555/1709404.1709407
https://doi.org/10.1016/0890-5401(92)90002-W

Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC

Autoren: Peter Clote

Quelle: Feasible Mathematics ISBN: 9780817634834

Zugangs-URL: https://link.springer.com/chapter/10.1007%2F978-1-4612-3466-1_4
https://rd.springer.com/chapter/10.1007/978-1-4612-3466-1_4

Equivalence classes and conditional hardness in massively parallel computations

Autoren: Na Nongkai, Danupon Scquizzato, M.

Quelle: Leibniz International Proceedings in Informatics, LIPIcs.

Schlagwörter: And phrases Massively parallel computation, Conditional hardness, Fine-grained complexity, Data handling, Hardness, Complexity class, Fine grained, Graph problems, Large-scale data processing, Lower bounds, Massively parallels, Space complexity, Specific problems, Equivalence classes

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-300987

Optimizing Parallel Task Execution for Multi-Agent Mission Planning

Autoren: Miloradović, Branko Curuklu, Baran Ekström, Mikael et al.

Quelle: IEEE Access. 11:24367-24381

Schlagwörter: Task analysis, Robots, Planning, Taxonomy, Resource management, Complexity theory, Analytical models, Multi-agent mission planning, multi-robot task allocation, parallel task execution, integer linear programming, constraint programming

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-62204
https://doi.org/10.1109/ACCESS.2023.3254900

On parallel hierarchies and R ki: On parallel hierarchies and \(R_k^i\)

Autoren: Stephen Bloch

Quelle: Lecture Notes in Computer Science ISBN: 9783540601784

Schlagwörter: parallel complexity classes, Complexity of computation (including implicit computational complexity), First-order arithmetic and fragments, Logic, witnessing theorem, bounded arithmetic hierarchy, parallel hierarchies, 0102 computer and information sciences, 0101 mathematics, conservativity, 01 natural sciences, Hierarchies of computability and definability

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1109909
https://doi.org/10.1016/s0168-0072(97)00035-3
https://dblp.uni-trier.de/db/conf/lcc/lcc94.html#Bloch94
https://link.springer.com/chapter/10.1007%2F3-540-60178-3_79
https://rd.springer.com/chapter/10.1007/3-540-60178-3_79
https://doi.org/10.1007/3-540-60178-3_79
https://dblp.uni-trier.de/db/journals/apal/apal89.html#Bloch97
https://www.sciencedirect.com/science/article/pii/S0168007297000353
http://www.sciencedirect.com/science/article/pii/S0168007297000353

Low complexity bit-parallel systolic architecture for computing C+AB, AB, C+AB2 or AB2 over a class of GF (2m)

Characterizations of parallel complexity classes

Weitere Verfasser: Venkateswaran, H

Quelle: Other Information: Thesis (Ph. D.)

Dateibeschreibung: Medium: X; Size: Pages: 97

Zugangs-URL: http://www.osti.gov/scitech/biblio/7245029

Function-algebraic characterizations of log and polylog parallel time

Autoren: Stephen Bloch

Quelle: Computational Complexity. 4:175-205

Schlagwörter: Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 0101 mathematics, Circuits, networks, 01 natural sciences, computational complexity classes, Recursive functions and relations, subrecursive hierarchies

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/627640
https://doi.org/10.1007/bf01202288
https://link.springer.com/article/10.1007%2FBF01202288
https://doi.org/10.1007/BF01202288
https://dblp.uni-trier.de/db/journals/cc/cc4.html#Bloch94

PARALLEL COMPLEXITY CLASSES CENTERED AROUND LOGCFL

Autoren: Nutan Limaye The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Nutan Limaye The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.imsc.res.in/~nutan/project.pdf.

Schlagwörter: 1.1.1 LogCFL and AuxPDA. 1

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9170; http://www.imsc.res.in/~nutan/project.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9170
http://www.imsc.res.in/~nutan/project.pdf

Characterizing parallel hierarchies by reducibilities

Autoren: Jianer Chen

Quelle: Information Processing Letters. 39:303-307

Schlagwörter: parallel complexity classes, oracle circuits, Complexity classes (hierarchies, relations among complexity classes, etc.), reducibility

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/33276
https://doi.org/10.1016/0020-0190(91)90003-z
https://www.sciencedirect.com/science/article/pii/002001909190003Z
https://dblp.uni-trier.de/db/journals/ipl/ipl39.html#Chen91
https://doi.org/10.1016/0020-0190(91)90003-Z

Parameter-bounded parallelism for fixed parameter tractable problems

Autoren: Vattes, Cyrus Bodlaender, Hans (Thesis Advisor)

Index Begriffe: This paper explores a gap in the hierarchies of parameterized parallel complexity and proposes a new class of parallel FPT algorithms called "bounded-process parallel FPT"., Master Thesis, Student Thesis

URL: https://studenttheses.uu.nl/handle/20.500.12932/48813

Molecular characterization and complexity of the immunoglobulin repertoire in the silver-black fox (Vulpes vulpes).

Autoren: Yi, Xiaohua Qiu, Yanbo Xie, Puhang et al.

Quelle: BMC Veterinary Research. 3/28/2025, Vol. 21 Issue 1, p1-16. 16p.

Schlagworte: Gene rearrangement, Gene expression, Red fox, Comparative method, Comparative genomics

Parameterized parallel complexity

Autoren: Simonsen, Jakob Grue Rotbart, Noy

Index Begriffe: parameterized complexity theory, inherently sequential problems, P-complete problems, MASTERPROGRAMMETHESIS

URL: https://curis.ku.dk/ws/files/366636539/Noy_Rotbart.pdf
SCIENCE speciale
SCIENCE Master thesis
Afsluttende semester
Final semester
https://curis.ku.dk/ws/files/366636539/Noy_Rotbart.pdf

On nondeterminism in parallel computation

Autoren: P W Dymond

Quelle: Theoretical Computer Science. 47:111-120

Schlagwörter: Nondeterministic parallel complexity classes, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Formal languages and automata, hardware modification machine, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4041260
https://doi.org/10.1016/0304-3975(86)90139-8
https://www.sciencedirect.com/science/article/pii/0304397586901398
https://www.sciencedirect.com/science/article/abs/pii/0304397586901398
https://dblp.uni-trier.de/db/journals/tcs/tcs47.html#Dymond86
https://core.ac.uk/display/82452035
https://doi.org/10.1016/0304-3975(86)90139-8

Two P-complete problems in the theory of the reals: Two \(P\)-complete problems in the theory of the reals

Autoren: A. Torrecillas Felipe Cucker

Quelle: Lecture Notes in Computer Science ISBN: 9783540542339

Schlagwörter: parallel complexity classes, PRAM, Statistics and Probability, Complexity of computation (including implicit computational complexity), Numerical Analysis, Algebra and Number Theory, Control and Optimization, Analysis of algorithms and problem complexity, Applied Mathematics, algebraic complexity, 0102 computer and information sciences, 01 natural sciences, systems of equations solvable by substitution, parallel algorithms over the reals, real circuit decision problem, 0101 mathematics

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/0885064X9290008Y
https://www.sciencedirect.com/science/article/abs/pii/0885064X9290008Y
https://dblp.uni-trier.de/db/journals/jc/jc8.html#CuckerT92
https://rd.springer.com/chapter/10.1007/3-540-54233-7_163
https://link.springer.com/chapter/10.1007%2F3-540-54233-7_163
https://link.springer.com/10.1007%2F3-540-54233-7_163
https://dblp.uni-trier.de/db/conf/icalp/icalp91.html#CuckerT91
https://doi.org/10.1007/3-540-54233-7_163

The feminine anaphoric gender gram, incipient gender marking, maturity, and extracting anaphoric gender markers from parallel texts

Autoren: Wälchli, Bernhard

Quelle: Grammatical gender and linguistic complexity Studies in Diversity Linguistics. :61-131

Schlagwörter: feminine gender, anaphora, anaphoric pronouns, grams, grammaticalization, grammatical relations, functional domains, constructional islands, cue validity, maturity, parallel texts, Linguistics, lingvistik

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-175425
https://doi.org/10.5281/zenodo.3462780

ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE: Analysis of PRAM instruction sets from a log cost perspective

Autoren: Sundararajan Vedantham Jerry L. Trahan

Quelle: International Journal of Foundations of Computer Science. :231-246

Schlagwörter: parallel complexity classes, time complexity, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, log cost measure

Dateibeschreibung: application/xml

Zugangs-URL: http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs5.html#TrahanV94
https://www.worldscientific.com/doi/abs/10.1142/S0129054194000128
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs5.html#TrahanV94