On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Victor A. Mikhailyuk / rank
Normal rank
 
Property / author
 
Property / author: Victor A. Mikhailyuk / 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.1007/s10559-012-9413-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102450844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally testable codes and PCPs of almost-linear length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: General approach to estimating the complexity of postoptimality analysis for discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Repetition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Latest revision as of 05:54, 9 July 2024

scientific article
Language Label Description Also known as
English
On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field
scientific article

    Statements

    On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (English)
    0 references
    27 October 2014
    0 references
    \(C\)-approximation algorithm
    0 references
    reoptimization
    0 references
    discrete Fourier analysis
    0 references
    PCP theorem
    0 references

    Identifiers