Dr. Ahmed G. Abo-Khalil

Electrical Engineering Department

Circuit complexity

In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute them.

A Boolean circuit with n input bits is a directed acyclic graph in which every node (usually called gates in this context) is either an input node of in-degree 0 labeled by one of the n input bits, an AND gate, an OR or a NOT gate. One of these gates is designated as the output gate. Such a circuit naturally computes a function of its n inputs. The size of a circuit is the number of gates it contains and its depth is the maximal length of a path from an input gate to the output gate.

Office Hours

Monday 10 -2

Tuesday 10-12

Thursday 11-1

My Timetable

Contacts


email: [email protected]

[email protected]

Phone: 2570

Welcome

Welcome To Faculty of Engineering

Almajmaah University

IEEE

Institute of Electrical and Electronics Engineers

http://www.ieee.org/

http://ieeexplore.ieee.org/Xplore/guesthome.jsp

http://ieee-ies.org/

http://www.ieee-pes.org/

http://www.pels.org/

Links of Interest

http://www.utk.edu/research/

http://science.doe.gov/grants/index.asp

http://www1.eere.energy.gov/vehiclesandfuels/

http://www.eere.energy.gov/


القران الكريم

http://quran.muslim-web.com/

Travel Web Sites

http://www.hotels.com/

http://www.orbitz.com/

http://www.hotwire.com/us/index.jsp

http://www.kayak.com/

Photovoltaic Operation


Wave Power

World's Simplest Electric Train



PeltierModule-JouleThief-Fridge

homemade Aircondition

Salt water battery


إحصائية الموقع

عدد الصفحات: 2880

البحوث والمحاضرات: 1292

الزيارات: 46673