Parameterized circuit complexity and the \(W\) hierarchy (Q1127315): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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: Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse parameterized problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281497 / 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: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(96)00317-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997639167 / rank
 
Normal rank

Latest revision as of 10:57, 30 July 2024

scientific article
Language Label Description Also known as
English
Parameterized circuit complexity and the \(W\) hierarchy
scientific article

    Statements

    Parameterized circuit complexity and the \(W\) hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    13 August 1998
    0 references
    0 references
    satisfiability problem
    0 references
    weft-\(t\) circuits
    0 references
    0 references