A note on the permanent value problem
type: Item
instance of: scholarly article
title: A note on the permanent value problem
zbMATH Open document ID: 0780.68067
DOI: 10.1016/0020-0190(92)90021-M
author: Sanjeev Saluja
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 15B36
zbMATH DE Number: 92075
zbMATH Keywords: integer matrices
zbMATH Keywords: computational complexity
zbMATH Keywords: permanent
zbMATH Keywords: counting classes
MaRDI profile type: Publication
cites work: The complexity of theorem-proving procedures
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: Computational Work and Time on Finite Machines
cites work: The polynomial-time hierarchy
cites work: PP is as Hard as the Polynomial-Time Hierarchy
cites work: The complexity of computing the permanent
cites work: The complexity of combinatorial problems with succinct input representation
full work available at URL: 0020-0190(92)90021-m
OpenAlex ID: W2012706785
Wikidata QID: Q127321120
description: scientific article; zbMATH DE number 92075