A note on \(\#\mathcal P\)-completeness of NP-witnessing relations (Q976088): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.10.009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1991202395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4348128 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4140381 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of optimization problems / rank | |||
Normal rank |
Latest revision as of 21:56, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on \(\#\mathcal P\)-completeness of NP-witnessing relations |
scientific article |
Statements
A note on \(\#\mathcal P\)-completeness of NP-witnessing relations (English)
0 references
16 June 2010
0 references
computational complexity
0 references
\(\#\mathcal P\)-completeness
0 references
NP
0 references