Dr. Ahmed G. Abo-Khalil

Electrical Engineering Department

complexity theory

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a computational problem is understood to be a task that is in principle amenable to being solved by a computer (i.e. the problem can be stated by a set of mathematical instructions). Informally, a computational problem consists of problem instances and solutions to these problem instances. For example, primality testing is the problem of determining whether a given number is prime or not. The instances of this problem are natural numbers, and the solution to an instance is yes or no based on whether the number is prime or not.

Office Hours

Monday 10 -2

Tuesday 10-12

Thursday 11-1

My Timetable

Contacts


email: a.abokhalil@mu.edu.sa

a_galal@yahoo.com

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

الزيارات: 41825