Completeness and weak completeness under polynomial-size circuits
type: Item
instance of: scholarly article
title: Completeness and weak completeness under polynomial-size circuits
zbMATH Open document ID: 0853.68098
author: Jack H. Lutz
author: David W. Juedes
published in: Information and Computation
publication date: 1997-01-02T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 896633
zbMATH Keywords: nonuniform complexity of problems
zbMATH Keywords: weakly P/Poly-Turing-complete problems
MaRDI profile type: Publication
full work available at URL: inco.1996.0017
OpenAlex ID: W2029295554
DOI: 10.1006/INCO.1996.0017
description: scientific article; zbMATH DE number 896633