Search Results - "parallel computational complexity"
-
1
Authors:
Source: SIAM Journal on Computing. 27:1295-1302
Subject Terms: 0508 media and communications, Analysis of algorithms and problem complexity, 05 social sciences, Lattices and convex bodies (number-theoretic aspects), lattice basis reduction, 0211 other engineering and technologies, Distributed algorithms, parallel algorithms, 02 engineering and technology, parallel computational complexity, Number-theoretic algorithms, complexity
File Description: application/xml
-
2
Authors:
Source: SIAM Journal on Computing. 27:960-971
Subject Terms: Complexity of computation (including implicit computational complexity), greatest common divisor, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, parallel computational complexity, Euclidean algorithm, 01 natural sciences, integer linear programming
File Description: application/xml
-
3
Authors: DE AGOSTINO, Sergio
Source: Theoretical Computer Science. 127:181-186
Subject Terms: Information storage and retrieval of data, Analysis of algorithms and problem complexity, parallelization, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, parallel computational complexity, 01 natural sciences, data compression, Theoretical Computer Science, Computer Science(all)
File Description: application/xml
-
4
Authors: Andrew Chin
Source: Information Processing Letters. 45:69-73
Subject Terms: block PRAM complexity, shared-memory, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, parallel computers, Combinatorics in computer science, 0102 computer and information sciences, 02 engineering and technology, parallel computational complexity, permutation routing, 01 natural sciences, communication latency
File Description: application/xml
Access URL: https://zbmath.org/167737
https://doi.org/10.1016/0020-0190(93)90218-x
https://www.sciencedirect.com/science/article/pii/002001909390218X
https://doi.org/10.1016/0020-0190(93)90218-X
https://dblp.uni-trier.de/db/journals/ipl/ipl45.html#Chin93
http://andrewchin.com/chin/scholarship/permutations.pdf -
5
Authors:
Source: Department of Computer Science Technical Reports
Subject Terms: 0209 industrial biotechnology, Computer Sciences, Analysis of algorithms and problem complexity, visible regions, Computer graphics, computational geometry (digital and algorithmic aspects), computational geometry, simple polygons, 0102 computer and information sciences, 02 engineering and technology, parallel computational complexity, intersections of polygonal chains, 01 natural sciences
File Description: application/xml; application/pdf
Access URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1650&context=cstech
https://zbmath.org/622325
https://doi.org/10.1145/116825.116827
https://docs.lib.purdue.edu/cstech/651/
https://dblp.uni-trier.de/db/journals/jacm/jacm38.html#AtallahCW91
https://dl.acm.org/doi/10.1145/116825.116827
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1650&context=cstech
https://docs.lib.purdue.edu/cstech/651
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1650&context=cstech -
6
Authors:
Source: Lecture Notes in Computer Science ISBN: 9783540167662
Subject Terms: triangular Toeplitz matrix inversion, Analysis of algorithms and problem complexity, 4. Education, interpolation by binary segmentation, 0102 computer and information sciences, parallel computational complexity, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences, Boolean circuit complexity, Software, source code, etc. for problems pertaining to field theory, division with remainder, 0101 mathematics, integer polynomials, polynomial division
File Description: application/xml
Access URL: https://zbmath.org/4066311
https://doi.org/10.1016/0020-0190(87)90139-6
http://www.sciencedirect.com/science/article/pii/0020019087901396
https://link.springer.com/chapter/10.1007%2F3-540-16766-8_22
https://www.sciencedirect.com/science/article/pii/0020019087901396
https://core.ac.uk/display/54857420
https://rd.springer.com/chapter/10.1007/3-540-16766-8_22
https://dblp.uni-trier.de/db/journals/ipl/ipl24.html#BiniP87
https://link.springer.com/chapter/10.1007%2F3-540-16766-8_22
https://link.springer.com/10.1007%2F3-540-16766-8_22
https://dblp.uni-trier.de/db/conf/awoc/awoc86.html#BiniP86
https://hdl.handle.net/11568/7967 -
7
Authors: Victor Y. Pan
Source: Computers & Mathematics with Applications. 14:285-304
Subject Terms: zeros of polynomials, Analysis of algorithms and problem complexity, upper estimates of relative errors, Parallel numerical computation, 0102 computer and information sciences, sequential and parallel computational complexity, 01 natural sciences, Computational Mathematics, cost operations, Computational Theory and Mathematics, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), Modelling and Simulation, Numerical computation of solutions to single equations, 0101 mathematics, Graeffe-Runge method, Turan method
File Description: application/xml
Full Text Finder 
Nájsť tento článok vo Web of Science