Marginal hitting sets imply super-polynomial lower bounds for permanent (Q2826080): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1145/2090236.2090275 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072311401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Strong Dimension in Algorithmic Information and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Well-Calibrated Bayesian / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Forecast Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic calibration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension in Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dimensions of individual strings and sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reproducible properties of correct forecasts / rank
 
Normal rank

Latest revision as of 16:15, 12 July 2024

scientific article
Language Label Description Also known as
English
Marginal hitting sets imply super-polynomial lower bounds for permanent
scientific article

    Statements

    Marginal hitting sets imply super-polynomial lower bounds for permanent (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    arithmetic circuits
    0 references
    computational complexity theory
    0 references
    derandomization
    0 references
    lower bounds
    0 references
    permanent
    0 references
    polynomial identity testing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references