Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The polynomially bounded perfect matching problem is in NC2
 

Summary: The polynomially bounded
perfect matching problem is in NC2
Manindra Agrawal1
, Thanh Minh Hoang2
, and Thomas Thierauf3
1
IIT Kanpur, India
2
Ulm University, Germany
3
Aalen University, Germany
Abstract. The perfect matching problem is known to be in , in ran-
domized NC, and it is hard for NL. Whether the perfect matching prob-
lem is in NC is one of the most prominent open questions in complexity
theory regarding parallel computations.
Grigoriev and Karpinski [GK87] studied the perfect matching problem
for bipartite graphs with polynomially bounded permanent. They showed
that for such bipartite graphs the problem of deciding the existence of a
perfect matchings is in NC2
, and counting and enumerating all perfect

  

Source: Agrawal, Manindra - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur

 

Collections: Computer Technologies and Information Sciences