Revisiting the complexity of and/or graph solution (Q394337): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C78 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6250591 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
and/or graphs | |||
Property / zbMATH Keywords: and/or graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational complexity | |||
Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fixed parameter tractability | |||
Property / zbMATH Keywords: fixed parameter tractability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
NP-hardness | |||
Property / zbMATH Keywords: NP-hardness / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
W[1]-hardness | |||
Property / zbMATH Keywords: W[1]-hardness / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
W[2]-hardness | |||
Property / zbMATH Keywords: W[2]-hardness / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2027224637 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1203.3249 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4453144 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Models for parallel and distributed computation. Theory, algorithmic techniques and application / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parametrized complexity theory. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A randomized competitive algorithm for evaluating priced AND/OR trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5710169 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computationally Related Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Optimal Solutions to AND/OR Series-Parallel Graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:23, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Revisiting the complexity of and/or graph solution |
scientific article |
Statements
Revisiting the complexity of and/or graph solution (English)
0 references
27 January 2014
0 references
and/or graphs
0 references
computational complexity
0 references
fixed parameter tractability
0 references
NP-hardness
0 references
W[1]-hardness
0 references
W[2]-hardness
0 references
0 references