Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Fan-in

Known as: Fan in, Fanin 
Fan-in is the number of inputs a gate can handle. For instance the fan-in for the AND gate shown in the figure is 3. Physical logic gates with a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
This paper surveys quantum learning theory: the theoretical aspects of machine learning using quantum computers. We describe the… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. While exhaustive search… Expand
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We first show how to construct an O(n)-depth O(n)-size quantum circuit for additionof two n-bit binary numbers with no ancillary… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The use of biomass cook stoves is widespread in the rural communities of developing countries. It is important to improve the… Expand
  • figure 2
  • figure 3
  • figure 1
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Do you need to know how to write systems, services, and applications using the TinyOS operating system? Learn how to write nesC… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
  • M. Agrawal, V. Vinay
  • 49th Annual IEEE Symposium on Foundations of…
  • 2008
  • Corpus ID: 47052536
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
It has been known since the mid-1980s (SIAM J. Comput. 15 (1986) 994; SIAM J. Comput. 21 (1992) 896) that integer division can be… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Let ~(zI,... ,zn) be computed by a circuit C with bounded fanin. There are non-cryptographic protocols (BGW88,CCD88] by which a… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
  • M. Snir
  • SIAM J. Comput.
  • 1985
  • Corpus ID: 9570656
We investigate the complexity of searching a sorted table of n elements on a synchronous, shared memory parallel computer with p… Expand
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1964
Highly Cited
1964
  • R. C. Minnick
  • IEEE Trans. Electron. Comput.
  • 1964
  • Corpus ID: 34596231
A cutpoint cellular array is a two-dimensional rectangular arrangement of square cells, each of which has binary inputs on the… Expand
  • figure 1
  • table II
  • table III
  • figure 3
  • figure 5
Is this relevant?