Pith. sign in

REVIEW 1 cited by

Progress on Polynomial Identity Testing - II

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1401.0976 v1 pith:JVSARUL3 submitted 2014-01-06 cs.CC cs.DMmath.ACmath.AG

Nitin Saxena This is my paper · ORCID
classification cs.CCcs.DMmath.ACmath.AG
keywords identitypolynomialtestingalgebraicareacomplexitydiscussfocus
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We survey the area of algebraic complexity theory; with the focus being on the problem of polynomial identity testing (PIT). We discuss the key ideas that have gone into the results of the last few years.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Identity Testing for Circuits with Exponentiation Gates

    cs.CC 2025-06 conditional novelty 6.0 of 10

    Identity testing for circuits with exponentiation gates can be done by one random query, with proof that in a two-modulus finite-field model the error is controlled by a weak Descartes rule.

Pith tools