Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694): 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.1080/00207168908803783 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116378217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knots and links in spatial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive advances in polynomial-time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3661483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional logic gate assignment and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Paths—A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank

Latest revision as of 11:38, 16 May 2024

scientific article
Language Label Description Also known as
English
Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup>
scientific article

    Statements

    Identifiers