Search Results - "parallel computational complexity"

  • Showing 1 - 3 results of 3
Refine Results
  1. 1
    Cover Image

    Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm by Heckler, C., Thiele, L.

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.10.1998
    Published in SIAM journal on computing (01.10.1998)
    “…Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    Planar Integer Linear Programming is NC Equivalent to Euclidean GCD by Shallcross, D. F., Pan, V. Y., Lin-Kriz, Y.

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1998
    Published in SIAM journal on computing (01.08.1998)
    “…It is not known if planar integer linear programming is P-complete or if it is in NC, and the same can be said about the computation of the remainder sequence…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    Parallel solution of dense linear systems using diagonalization methods by Cosnard, M., Robert, Y., Trystram, D.

    ISSN: 0020-7160, 1029-0265
    Published: Gordon and Breach Science Publishers 01.01.1987
    “…We study the parallel implementation of two diagonalization methods for solving dense linear systems: the well known Gauss-Jordan method and a new one…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: