Skip to main content
Article thumbnail
Location of Repository

Complexity of Linear Connectivity Problems in Directed Hypergraphs

By Mayur Thakur and Rahul Tripathi

Abstract

p 2, \Pi p 2, and DP) of the polynomial hierarchy

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.4920
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.usf.edu/~tripat... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.