Hierarchies in fragments of monadic strict NP

Martin, Barnaby and Madelaine, Florent (2007) Hierarchies in fragments of monadic strict NP. In: Computation and logic in the real world: Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings. Cooper, Barry S., Löwe, Benedikt and Sorbi, Andrea, eds. Lecture Notes in Computer Science, 4497 . Springer Berlin Heidelberg, pp. 542-550. ISBN 9783540730002. (doi:10.1007/978-3-540-73001-9_56)

Abstract

We expose a strict hierarchy within monotone monadic strict NP without inequalities (MMSNP), based on the number of second-order monadic quantifiers. We do this by studying a finer strict hierarchy within a class of forbidden patterns problems (FPP), based on the number of permitted colours. Through an adaptation of a preservation theorem of Feder and Vardi, we are able to prove that this strict hierarchy also exists in monadic strict NP (MSNP). Our hierarchy results apply over a uniform signature involving a single binary relation, that is over digraphs.

Item Type: Book Section
Additional Information: Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007. Proceedings
Research Areas: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 11114
Depositing User: Devika Mohan
Date Deposited: 02 Jul 2013 07:01
Last Modified: 11 Apr 2019 19:17
URI: https://eprints.mdx.ac.uk/id/eprint/11114

Actions (login required)

Edit Item Edit Item