![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Impagliazzo R. Paturi R. Zane F.
Publisher: Academic Press
ISSN: 0022-0000
Source: Journal of Computer and System Sciences, Vol.63, Iss.4, 2001-12, pp. : 512-530
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the Complexity of Strongly Connected Components in Directed Hypergraphs
Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Complexity of tile rotation problems
Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Complexity and algorithms for nonlinear optimization problems
Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Complexity of path discovery game problems
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :