White-box vs. black-box complexity of search problems: Ramsey and graph property testing (Q6946323)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8076690
Language Label Description Also known as
default for all languages
No label defined
    English
    White-box vs. black-box complexity of search problems: Ramsey and graph property testing
    scientific article; zbMATH DE number 8076690

      Statements

      White-box vs. black-box complexity of search problems: Ramsey and graph property testing (English)
      0 references
      0 references
      0 references
      0 references
      6 August 2025
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references