On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in approximation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Minimally Infeasible Subsystems of Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency, redundancy, and implied equalities in linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to Diagnosing Infeasible Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees and hills: methodology for maximizing functions of systems of linear relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Difficulty of Designing Good Classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Infeasible Mixed-Integer and Integer Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum maximal independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust trainability of single neurons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest hemisphere problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong lower bounds on the approximability of some NPO PB-complete maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Discriminant Functions Determined by Genetic Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Misclassification minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the minimum weight IIS cover of an infeasible system of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on resolving infeasibility in linear programs by constraint relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum feature set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition / rank
 
Normal rank

Revision as of 16:59, 28 May 2024

scientific article
Language Label Description Also known as
English
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
scientific article

    Statements

    On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (English)
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    linear systems
    0 references
    unsatisfied relations
    0 references
    nonzero variables
    0 references
    approximability bounds
    0 references
    designing linear classifiers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers