Average-case rigidity lower bounds (Q2117087): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/978-3-030-79416-3_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3177031611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short PCPs with Projection Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong average-case lower bounds from non-trivial derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An average-case lower bound against \(\mathsf{ACC}^0\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Yao’s XOR-Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving exhaustive search implies superpolynomial lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural Proofs versus Derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms and lower bounds for circuits with linear threshold gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform ACC Circuit Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turing machine time hierarchy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:05, 28 July 2024

scientific article
Language Label Description Also known as
English
Average-case rigidity lower bounds
scientific article

    Statements

    Average-case rigidity lower bounds (English)
    0 references
    0 references
    0 references
    21 March 2022
    0 references
    average-case lower bounds
    0 references
    matrix rigidity
    0 references
    correlation bounds
    0 references

    Identifiers