Suchergebnisse - "parallel complexity classes"

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

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

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

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

ALOGTIME and a conjecture of S.A. Cook: ALOGTIME and a conjecture of S. A. Cook

Autoren: Peter Clote

Quelle: Annals of Mathematics and Artificial Intelligence. 6:57-106

Schlagwörter: Complexity of proofs, parallel complexity classes, Complexity of computation (including implicit computational complexity), free variable equational logic, 0102 computer and information sciences, 01 natural sciences, Mechanization of proofs and logical operations, Classical propositional logic, resolution proof, Frege proofs, Complexity classes (hierarchies, relations among complexity classes, etc.), NC, 0101 mathematics, propositional calculus

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/amai/amai6.html#Clote92
https://link.springer.com/article/10.1007/BF01531023
https://ieeexplore.ieee.org/document/113744/
https://link.springer.com/article/10.1007/BF01531023

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

The Computing Power of Programs over Finite Monoids: The computing power of programs over finite monoids

Autoren: Tesson, Pascal Thérien, Denis

Schlagwörter: parallel complexity classes, small-depth Boolean circuits, Formal languages and automata

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1916674

The design of a parallel algorithm to solve the word problem for the free partially commutative groups

Autoren: Gabarró Vallès, Joaquim Universitat Politècnica de Catalunya. Departament de Ciències de la Computació Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Weitere Verfasser: Gabarró Vallès, Joaquim Universitat Politècnica de Catalunya. Departament de Ciències de la Computació Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Schlagwörter: Àrees temàtiques de la UPC::Informàtica, Parallel algorithms, Word problems (Mathematics), PRAMS, Data parallel algorithms, Modular design, Trace theory, Free groups, Free partially commutative groups, Word problems, Parallel complexity classes, NC, NL, ACo, Complete problems, Algorismes paral·lels, Paraules, Problemes de (Matemàtica)

Dateibeschreibung: 15 p.; application/pdf

Relation: LSI-91-39; Gabarro, J. The design of a parallel algorithm to solve the word problem for the free partially commutative groups. 1991.; http://hdl.handle.net/2117/330529

Verfügbarkeit: http://hdl.handle.net/2117/330529

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

The design of a parallel algorithm to solve the word problem for the free partially commutative groups

Autoren: Universitat Politècnica de Catalunya. Departament de Ciències de la Computació Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals Gabarró Vallès, Joaquim

Index Begriffe: Àrees temàtiques de la UPC::Informàtica, Parallel algorithms, Word problems (Mathematics), PRAMS, Data parallel algorithms, Modular design, Trace theory, Free groups, Free partially commutative groups, Word problems, Parallel complexity classes, NC, NL, ACo, Complete problems, Algorismes paral·lels, Paraules, Problemes de (Matemàtica), External research report

URL: http://hdl.handle.net/2117/330529
LSI-91-39