Succinct circuit representations and leaf language classes are basically the same concept
type: Item
instance of: scholarly article
title: Succinct circuit representations and leaf language classes are basically the same concept
zbMATH Open document ID: 0875.68429
DOI: 10.1016/0020-0190(96)00096-8
author: Bernd Borchert
author: Antoni Lozano
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 983399
zbMATH Keywords: Computational complexity
zbMATH Keywords: Leaf language classes
zbMATH Keywords: Succinct representations
zbMATH Keywords: Polynomial-time many-one completeness
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00096-8
OpenAlex ID: W2016550752
cites work: Q4039803
cites work: Q4835660
cites work: Complexity classes and sparse oracles
cites work: A uniform approach to define complexity classes
cites work: Q4138187
cites work: Succinct representations of graphs
cites work: Logspace and logtime leaf languages
cites work: Q4142699
cites work: Computational Work and Time on Finite Machines
cites work: Succinct representation, leaf languages, and projection reductions
description: scientific article; zbMATH DE number 983399