Constructive complexity (Q1182305): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57360155, #quickstatements; #temporary_batch_1708557319324
Created claim: DBLP publication ID (P1635): journals/dam/AbrahamsonFLM91, #quickstatements; #temporary_batch_1731475607626
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Karl A. Abrahamson / rank
Normal rank
 
Property / author
 
Property / author: Karl A. Abrahamson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive advances in polynomial-time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: On helping by robust oracle machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the n<sup>log n</sup> isomorphism technique (A Preliminary Report) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density and complexity of polynomial cores for intractable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic algorithm for testing primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Factoring Based on Partial Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Paths—A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-transformable combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms: a different approach to oracles / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(91)90074-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2912709233 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dam/AbrahamsonFLM91 / rank
 
Normal rank

Latest revision as of 06:41, 13 November 2024

scientific article
Language Label Description Also known as
English
Constructive complexity
scientific article

    Statements

    Constructive complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    blind oracles
    0 references
    decision problems
    0 references
    polynomial-time solvability
    0 references
    constructive theory of complexity
    0 references
    self-reducibility
    0 references
    oracle machines
    0 references

    Identifiers