Satisfiability of co-nested formulas
type: Item
instance of: scholarly article
title: Satisfiability of co-nested formulas
zbMATH Open document ID: 0790.68050
DOI: 10.1007/BF01209713
author: Jan Kratochvíl
author: Mirko Křivánek
published in: Acta Informatica
publication date: 1994-06-02T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 567298
zbMATH Keywords: decidability
zbMATH Keywords: satisfiability
zbMATH Keywords: co-nested formulas
MaRDI profile type: Publication
cites work: The complexity of induced minors and related problems
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: Efficient Planarity Testing
cites work: Nested satisfiability
cites work: Noncrossing Subgraphs in Topological Layouts
cites work: Planar Formulae and Their Uses
description: scientific article; zbMATH DE number 567298