The complexity of polynomial-time approximation (Q2464331): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57359962, #quickstatements; #temporary_batch_1706897434465
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Li-Ming Cai / rank
Normal rank
 
Property / author
 
Property / author: David W. Juedes / rank
Normal rank
 
Property / author
 
Property / author: Frances A. Rosamond / rank
Normal rank
 
Property / author
 
Property / author: Li-Ming Cai / rank
 
Normal rank
Property / author
 
Property / author: David W. Juedes / rank
 
Normal rank
Property / author
 
Property / author: Frances A. Rosamond / rank
 
Normal rank
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.1007/s00224-007-1346-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092838574 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:01, 19 March 2024

scientific article
Language Label Description Also known as
English
The complexity of polynomial-time approximation
scientific article

    Statements

    The complexity of polynomial-time approximation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references