Sheaf Cohomology is #P-hard

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.27, Iss.4, 1999-04, pp. : 429-433

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A sheaf-theoretic topos model of the physical 'Continuum' and its cohomological observable dynamics

By Zafiris Elias

International Journal of General Systems, Vol. 38, Iss. 1, 2009-01 ,pp. : 1-27

Taylor & Francis Ltd

Access to resources Recommend Favorite

Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)

By Anter Amir

Natural Computing, Vol. 9, Iss. 4, 2010-12 ,pp. : 891-902

Springer Publishing Company

Access to resources Recommend Favorite

On hard instances

By Mundhenk

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 301-311

Elsevier

Access to resources Recommend Favorite

Uniformly hard languages

By Downey R. Fortnow L.

Theoretical Computer Science, Vol. 298, Iss. 2, 2003-04 ,pp. : 303-315

Elsevier

Access to resources Recommend Favorite

Alternatives to truthfulness are hard to recognize

By Auletta Vincenzo

Autonomous Agents and Multi-Agent Systems, Vol. 22, Iss. 1, 2011-01 ,pp. : 200-216

Springer Publishing Company

Access to resources Recommend Favorite