Monotone separations for constant degree polynomials

Information Processing Letters

Volumn 110, Issue 1, 2009, Pages 1-3

  Hrubeš, Pavel ^a   Yehudayoff, Amir ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Algebraic complexity; Arithmetic circuit; Arithmetic formula; Computational complexity; Constant degree

Indexed keywords

ALGEBRAIC COMPLEXITY; ARITHMETIC CIRCUIT; ARITHMETIC FORMULA; CONSTANT DEGREE; MONOTONE FORMULAS; UPPER BOUND;

INTEGRATING CIRCUITS; LOGIC CIRCUITS; POLYNOMIALS; SEPARATION;

COMPUTATIONAL COMPLEXITY;

EID: 70449522176     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.09.003     Document Type: Article

References (6)

1. Hrubeš P., and Yehudayoff A. Homogeneous formulas and symmetric polynomials. arXiv:0907.2621v1
2. Jerrum M., and Snir M. Some exact complexity results for straight-line computations over semirings. Journal of the ACM 29 3 (1982) 874-897
3. Raz R. Elusive functions and lower bounds for arithmetic circuits. Proceedings of the 40th STOC (2008) 711-720
4. Shamir E., and Snir M. On the depth complexity of formulas. Journal Theory of Computing Systems 13 1 (1979) 301-322
5. Shpilka A., and Wigderson A. Depth-3 arithmetic formulae over fields of characteristic zero. Journal of Computational Complexity 10 1 (2001) 1-27
6. Valiant L.G. Negation can be exponentially powerful. Theoretical Computer Science 12 (1980) 303-314