Nonconstructive advances in polynomial-time complexity (Q1098635): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Disjoint Paths—A Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3684139 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equivalents of the axiom of choice. 2nd ed / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank | |||
Normal rank | |||
Revision as of 15:07, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonconstructive advances in polynomial-time complexity |
scientific article |
Statements
Nonconstructive advances in polynomial-time complexity (English)
0 references
1987
0 references
The following decision problem is defined: Gate matrix layout (GML): Instance: A Boolean matrix M and an integer k; Question: Can we permute the columns of M such that if in each row we change to * every 0 lying between the row's leftmost and rightmost 1, then no column contains more than k 1's and *'s ? The main result of the paper is that the fixed-k version of GML is solvable in polynomial time. The proof is nonconstructive and is based on a result of \textit{N. Robertson} and \textit{P. D. Seymour} [SIAM J. Algebraic Discrete Methods 6, 300-305 (1985; Zbl 0565.05045)].
0 references
Gate matrix layout
0 references
