Monadic logic programs and functional complexity
type: Item
instance of: scholarly article
title: Monadic logic programs and functional complexity
zbMATH Open document ID: 0903.68028
DOI: 10.1016/S0304-3975(96)00093-X
author: Armando B. Matos
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1178868
zbMATH Keywords: monadic logic programs
MaRDI profile type: Publication
cites work: Loop-programs and polynomially computable functions
cites work: Q4692772
cites work: Simple Programs Realize Exactly Presburger Formulas
cites work: Satisfiability of the smallest binary program
cites work: Algorithms for determining relative star height and star height
cites work: Q5592246
cites work: A characterization of time complexity by simple loop programs
cites work: Q5586197
cites work: Q5573961
description: scientific article; zbMATH DE number 1178868