Propositional proofs and reductions between NP search problems (Q435190): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F07 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6054355 / rank
 
Normal rank
Property / zbMATH Keywords
 
search problems
Property / zbMATH Keywords: search problems / rank
 
Normal rank
Property / zbMATH Keywords
 
Nullstellensatz
Property / zbMATH Keywords: Nullstellensatz / rank
 
Normal rank
Property / zbMATH Keywords
 
propositional proofs
Property / zbMATH Keywords: propositional proofs / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial-time reducibility
Property / zbMATH Keywords: polynomial-time reducibility / rank
 
Normal rank

Revision as of 23:48, 29 June 2023

scientific article
Language Label Description Also known as
English
Propositional proofs and reductions between NP search problems
scientific article

    Statements

    Propositional proofs and reductions between NP search problems (English)
    0 references
    0 references
    0 references
    11 July 2012
    0 references
    search problems
    0 references
    Nullstellensatz
    0 references
    propositional proofs
    0 references
    polynomial-time reducibility
    0 references

    Identifiers

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