A comment on \('''NP=P?'\) and restricted partitions'' (Q1083850): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ``NP\(=\)P?'' and restricted partitions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The art and theory of dynamic programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Latest revision as of 16:33, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comment on \('''NP=P?'\) and restricted partitions'' |
scientific article |
Statements
A comment on \('''NP=P?'\) and restricted partitions'' (English)
0 references
1986
0 references
The author discusses the approach of \textit{Zhang Guo-Qiang} [ibid. 32, 231-242 (1984; Zbl 0548.68043)] and concludes that it ''does not seem to be helpful in the development of techniques that might lead towards the proof of either \(P=NP\) or \(P\neq NP.\)''
0 references
NP
0 references
P
0 references
