LiU Electronic Press
Full-text not available in DiVA
Author:
Szalas, Andrzej (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Title:
On a logical approach to estimating computational complexity of potentially intractable problems
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the 14th International Symposium on Fundamentals of Computation Theory (FCT)
Editor:
G. Goos, J. Hartmanis, and J. van Leeuwen
Publisher: Springer
Series:
Lecture Notes in Computer Science, ISSN 0302-9743; 2751
Volume:
2751
Pages:
423-431
Year of publ.:
2003
URI:
urn:nbn:se:liu:diva-48511
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-48511
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Keywords(en) :
second-order logic, second-order quantifier elimination, descriptive complexity, transversal hypergraph problem
Abstract(en) :

In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complexity and second-order quantifier elimination techniques. We illustrate the approach on the case of the transversal hypergraph problem, TRANSHYP, which has attracted a great deal of attention. The complexity of the problem remains unsolved for over twenty years. Given two hypergraphs, G and H, TRANSHYP depends on checking whether G = H-d, where H-d is the transversal hypergraph of H. In the paper we provide a logical characterization of minimal transversals of a given hypergraph and prove that checking whether G subset of or equal to H-d is tractable. For the opposite inclusion the Problem still remains open. However, we interpret the resulting quantifier sequences in terms of determinism and bounded nondeterminism. The results give better upper bounds than those known from the literature, e.g., in the case when hypergraph H, has a sub-logarithmic number of hyperedges and (for the deterministic case) all hyperedges have the cardinality bounded by a function sub-linear wrt maximum of sizes of G and H.

Available from:
2009-10-11
Created:
2009-10-11
Last updated:
2011-02-25
Statistics:
12 hits