Parameterized Complexity Classes under Logical Reductions (Q3182930): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3007256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability, Definability, and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing parameterized complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Remarks on Generalized Spectra / rank
 
Normal rank

Latest revision as of 01:13, 2 July 2024

scientific article
Language Label Description Also known as
English
Parameterized Complexity Classes under Logical Reductions
scientific article

    Statements

    Identifiers