Composition limits and separating examples for some Boolean function complexity measures (Q1701350): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Michael E. Saks / rank
Normal rank
 
Property / author
 
Property / author: Michael E. Saks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2237303465 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1306.0630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum certificate complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of complexity measures for PRAMs and WRAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties and applications of boolean function composition / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:52, 15 July 2024

scientific article
Language Label Description Also known as
English
Composition limits and separating examples for some Boolean function complexity measures
scientific article

    Statements

    Composition limits and separating examples for some Boolean function complexity measures (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2018
    0 references
    0 references
    block sensitivity
    0 references
    certificate complexity
    0 references
    fractional certificate complexity
    0 references
    0 references
    0 references