Applications of parallel processors to some hard discrete problems (Q1089807): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0096-3003(86)90117-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066558790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Identities between Stirling Numbers and the Stabilizing Character Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forced Differences Between Terms of Subsequences of Integer Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aperiodic words on three symbols. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919722 / rank
 
Normal rank

Latest revision as of 19:02, 17 June 2024

scientific article
Language Label Description Also known as
English
Applications of parallel processors to some hard discrete problems
scientific article

    Statements

    Applications of parallel processors to some hard discrete problems (English)
    0 references
    0 references
    0 references
    1986
    0 references
    A part of investigation of problems in discrete mathematics involves using the computer. Such problems may or may not be exponential in complexity. This paper investigates the effect of complexity in such investigations and points out that such investigations are in essence an experimental science.
    0 references
    parallel processors
    0 references
    discrete mathematics
    0 references
    complexity
    0 references

    Identifiers