Author： Kayal Neeraj
Publisher： Springer Publishing Company
ISSN： 1016-3328
Source： computational complexity, Vol.15, Iss.4, 2006-12, pp. : 342-390
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
The complexity of minimal satisfiability problems
By Kirousis L.M. Kolaitis P.G.
Information and Computation, Vol. 187, Iss. 1, 2003-11 ,pp. :
Access to resources
Recommend
On the complexity of some data analysis problems
By Kel'manov A.
Computational Mathematics and Mathematical Physics, Vol. 50, Iss. 11, 2010-11 ,pp. :
Complexity of Generalized Satisfiability Counting Problems
Information and Computation, Vol. 125, Iss. 1, 1996-02 ,pp. :
On the Decisional Complexity of Problems Over the Reals
Information and Computation, Vol. 167, Iss. 1, 2001-05 ,pp. :