English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mahajan, Meena1, Author
Rao, Raghavendra B. V. 1, Author
Sreenivasaiah, Karteek2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20162016
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Mahajan2016
DOI: 10.1007/s00453-015-0101-z
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York : Springer-Verlag
Pages: - Volume / Issue: 76 (4) Sequence Number: - Start / End Page: 890 - 909 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793