A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Voting paradoxes and digraphs realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with large domination ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3901985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear equations over GF(2): Block Lanczos algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betweenness parameterized above tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arrangement problem parameterized above guaranteed value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of minimum profile problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the advantage over a random assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank

Latest revision as of 08:36, 2 July 2024

scientific article
Language Label Description Also known as
English
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
scientific article

    Statements

    Identifiers