Building Above Read-Once Polynomials: Identity Testing and Hardness of 
Representation

Mahajan, Meena; Rao, Raghavendra B. V.; Sreenivasaiah, Karteek

doi:10.1007/s00453-015-0101-z

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation

MPS-Authors

/persons/resource/persons79497

Sreenivasaiah, Karteek
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mahajan, M., Rao, R. B. V., & Sreenivasaiah, K. (2016). Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation. Algorithmica, 76(4), 890-909. doi:10.1007/s00453-015-0101-z.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-1017-F

Abstract

There is no abstract available