SCOPUS 정보 검색 플랫폼

Volumn 60, Issue 1, 1996, Pages 49-52

On the complexity of encoding in analog circuits

Author keywords

Analog circuits; Boolean functions; Computational complexity

Indexed keywords

EID: 0041538244 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(96)00137-8 Document Type: Article

Times cited : (3)

References (5)

1
- 0021370261
- A Boolean function requiring 3n network size
- N. Blum, A Boolean function requiring 3n network size, Theoret. Comput. Sci. 28 (1984) 337-345.
- (1984) Theoret. Comput. Sci. , vol.28 , pp. 337-345
- Blum, N.¹

2
- 0038088771
- A Boolean function
- E.I. Nechiporuk, A Boolean function, Soviet Math. Dokl. 7 (1966) 999-1000.
- (1966) Soviet Math. Dokl. , vol.7 , pp. 999-1000
- Nechiporuk, E.I.¹

3
- 0041575077
- On the computation of Boolean functions by analog circuits of bounded fan-in
- G. Turán and F. Vatan, On the computation of Boolean functions by analog circuits of bounded fan-in, in: Proc. 30th Symp, on Foundations of Computer Science (1994).
- (1994) Proc. 30th Symp, on Foundations of Computer Science
- Turán, G.¹ Vatan, F.²

4
- 0004203012
- Wiley-Teubner
- I, Wegener, The Complexity of Boolean Functions (Wiley-Teubner, 1987).
- (1987) The Complexity of Boolean Functions
- Wegener, I.¹

5
- 0026417075
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits
- I. Wegener, The complexity of the parity function in unbounded fan-in, unbounded depth circuits, Theoret. Comput. Sci. 85 (1991) 155-170.
- (1991) Theoret. Comput. Sci. , vol.85 , pp. 155-170
- Wegener, I.¹

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