메뉴 건너뛰기




Volumn 142, Issue 1-3 SPEC. ISS., 2004, Pages 181-187

Monotone Boolean formulas can approximate monotone linear threshold functions

Author keywords

Boolean formulas; Linear threshold functions; Monotone computation

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; POLYNOMIALS; PROBABILITY DENSITY FUNCTION; SET THEORY; THEOREM PROVING;

EID: 3142639211     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.02.003     Document Type: Article
Times cited : (14)

References (11)
  • 3
    • 0000069809 scopus 로고
    • Majority gates vs. general weighted threshold gates
    • Goldmann M., Håstad J., Razborov A. Majority gates vs. general weighted threshold gates. Comput. Complexity. 2:1992;277-300.
    • (1992) Comput. Complexity , vol.2 , pp. 277-300
    • Goldmann, M.1    Håstad, J.2    Razborov, A.3
  • 4
    • 0013416929 scopus 로고    scopus 로고
    • Simulating threshold circuits by majority circuits
    • Goldmann M., Karpinski M. Simulating threshold circuits by majority circuits. SIAM J. Comput. 27(1):1998;230-246.
    • (1998) SIAM J. Comput. , vol.27 , Issue.1 , pp. 230-246
    • Goldmann, M.1    Karpinski, M.2
  • 7
    • 0000420294 scopus 로고
    • On the size of weights for threshold gates
    • Håstad J. On the size of weights for threshold gates. SIAM J. Discrete Math. 7(3):1994;484-492.
    • (1994) SIAM J. Discrete Math. , vol.7 , Issue.3 , pp. 484-492
    • Håstad, J.1
  • 10
    • 0000378392 scopus 로고
    • Short monotone formulae for the majority function
    • Valiant L. Short monotone formulae for the majority function. J. Algorithms. 5:1984;363-366.
    • (1984) J. Algorithms , vol.5 , pp. 363-366
    • Valiant, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.