Testing equalities of multiplicative representations in polynomial time

Annual Symposium on Foundatons of Computer Science (Proceedings)

Volumn , Issue , 1993, Pages 422-426

  Ge, Guoqiang ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; THEOREM PROVING;

EQUALITIES; MULTIPLICATIVE REPRESENTATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0027886529     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)