On fixed-parameter tractability and approximability of NP optimization problems (Q1362338): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1997.1490 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043997666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On input read-modes of alternating Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of parameterized problems in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of bounded nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation properties of NP minimization classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limited nondeterminism and the complexity of the V-C dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank

Latest revision as of 17:55, 27 May 2024

scientific article
Language Label Description Also known as
English
On fixed-parameter tractability and approximability of NP optimization problems
scientific article

    Statements

    On fixed-parameter tractability and approximability of NP optimization problems (English)
    0 references
    3 August 1997
    0 references
    0 references
    fixed-parameter tractability
    0 references
    NP optimization problems
    0 references
    0 references
    0 references
    0 references