A note on \(\#\mathcal P\)-completeness of NP-witnessing relations
type: Item
instance of: scholarly article
title: A note on \(\#\mathcal P\)-completeness of NP-witnessing relations
zbMATH Open document ID: 1191.68341
author: Noam Livne
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5721983
zbMATH Keywords: computational complexity
zbMATH Keywords: \(\#\mathcal P\)-completeness
zbMATH Keywords: NP
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.10.009
OpenAlex ID: W1991202395
cites work: Q4348128
cites work: Q4140381
cites work: The complexity of computing the permanent
cites work: The complexity of optimization problems
DOI: 10.1016/J.IPL.2008.10.009
description: scientific article; zbMATH DE number 5721983