Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.jcss.2005.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1542263829 / 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: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on monotone dualization and generating hypergraph transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query evaluation via tree-decompositions / 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: Model-Checking Problems as a Basis for Parameterized Intractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / 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: On the complexity of database queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank

Latest revision as of 15:01, 11 June 2024

scientific article
Language Label Description Also known as
English
Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
scientific article

    Statements

    Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    0 references
    Fixed-parameter tractability
    0 references
    Limited nondeterminism
    0 references
    0 references