de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons79497

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-002C-1017-F
Abstract
There is no abstract available