Work

Building above Read-once Polynomials: Identity Testing and Hardness of Representation

Year: 2014

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-319-08783-2_1

Authors: Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Institutions: Institute of Mathematical Sciences, Indian Institute of Technology Madras

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2134465450

FWCI: 0.839

Cites: 21

Cited by: 4

Related to: 10