Author： Raghavendra Rao B.
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.49, Iss.2, 2011-08, pp. : 246-272
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On the graphic matroid parity problem
By Szigeti Z.
Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. :
Access to resources
Recommend
The linear delta-matroid parity problem
By Geelen J.F. Iwata S. Murota K.
Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. :
Strong isomorphism reductions in complexity theory
The Journal of Symbolic Logic, Vol. 76, Iss. 4, 2011-12 ,pp. :
The isomorphism problem for classes of computable fields
Archive for Mathematical Logic, Vol. 43, Iss. 3, 2004-04 ,pp. :
A note on the isomorphism problem for
The Journal of Symbolic Logic, Vol. 66, Iss. 3, 2001-09 ,pp. :