The enumerability of P collapses P to NC

Alina Beygelzimer, Mitsunori Ogihara

Research output: Contribution to journalArticlepeer-review


We show that one cannot rule out even a single possibility for the value of an arithmetic circuit on a given input using an NC algorithm, unless P collapses to NC (i.e., unless all problems with polynomial-time sequential solutions can be efficiently parallelized). Thus excluding any possible solution in this case is as hard as finding the solution exactly. The result is robust with respect to NC algorithms that err (i.e., exclude the correct value) with small probability. We also show that P collapses all the way down to NC 1 when the characteristic of the field that the problem is over is sufficiently large (but in this case under a stronger elimination hypothesis that depends on the characteristic).

Original languageEnglish (US)
Pages (from-to)346-355
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
StatePublished - Dec 1 2004
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'The enumerability of P collapses P to NC'. Together they form a unique fingerprint.

Cite this