The query complexity of witness finding (Q2411034): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2523399274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of average case complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shadows and intersections in vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is Valiant-Vazirani's isolation probability improvable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank

Latest revision as of 13:51, 14 July 2024

scientific article
Language Label Description Also known as
English
The query complexity of witness finding
scientific article

    Statements

    The query complexity of witness finding (English)
    0 references
    0 references
    0 references
    0 references
    20 October 2017
    0 references
    query complexity
    0 references
    witness finding problem
    0 references
    search-to-decision reduction
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references