On derandomization and average-case complexity of monotone functions (Q428873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2012.02.017 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q87 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / 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: 6049393 / rank
 
Normal rank
Property / zbMATH Keywords
 
derandomization
Property / zbMATH Keywords: derandomization / rank
 
Normal rank
Property / zbMATH Keywords
 
monotone circuits
Property / zbMATH Keywords: monotone circuits / rank
 
Normal rank
Property / zbMATH Keywords
 
monotone functions
Property / zbMATH Keywords: monotone functions / rank
 
Normal rank
Property / zbMATH Keywords
 
randomized algorithm
Property / zbMATH Keywords: randomized algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
pseudorandom generators
Property / zbMATH Keywords: pseudorandom generators / rank
 
Normal rank
Property / zbMATH Keywords
 
average-case complexity
Property / zbMATH Keywords: average-case complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047406446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for the approximation of Boolean functions and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fourier spectrum of monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Pseudo-random Generators from Weaker Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space hierarchy results for randomized and other semantic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness amplification within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple extractors for all min-entropies and a new pseudorandom generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gap between monotone and non-monotone circuit complexity is exponential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-random generators for all hardnesses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation is Powerless for Boolean Slice Functions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2012.02.017 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:18, 9 December 2024

scientific article
Language Label Description Also known as
English
On derandomization and average-case complexity of monotone functions
scientific article

    Statements

    On derandomization and average-case complexity of monotone functions (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2012
    0 references
    derandomization
    0 references
    monotone circuits
    0 references
    monotone functions
    0 references
    randomized algorithm
    0 references
    pseudorandom generators
    0 references
    average-case complexity
    0 references

    Identifiers

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