Hard Instances of Algorithms and Proof Systems (Q5892128): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Do there exist complete sets for promise classes? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on resource-bounded measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On p-Optimal Proof Systems and Logics for PTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON OPTIMAL INVERTERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: If NP languages are hard on the worst-case, then it is easy to find their hard instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness, Approximation and Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal proof systems imply complete sets for promise classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observations on measure and lowness for \(\Delta_ 2^ p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost every set in exponential time is P-bi-immune / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speedup for natural problems and noncomputability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an optimal propositional proof system and the structure of easy subsets of TAUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422270 / rank
 
Normal rank

Latest revision as of 18:02, 10 July 2024

scientific article; zbMATH DE number 6478364
Language Label Description Also known as
English
Hard Instances of Algorithms and Proof Systems
scientific article; zbMATH DE number 6478364

    Statements

    Hard Instances of Algorithms and Proof Systems (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2015
    0 references
    hard sequences
    0 references
    measure hypothesis
    0 references
    optimal algorithms
    0 references
    optimal proof systems
    0 references

    Identifiers