Fall 2016
- Instructor: Vladik Kreinovich, email vladik@utep.edu,
office CCSB 3.0404,
office phone (915) 747-6951 - Class time: Tuesdays and Thursdays, 9-10:20 am, Room Liberal Arts 106
- Details: Syllabus
Faculty office hours
- Tuesdays and Thursdays
10:30-11:30 am, or
by appointment.
Teaching Assistants (TA)
- Angel Garcia Contreras,
email afgarciacontreras@miners.utep.edu,
office hours Tuesday and Thursday 1:30 - 3:00 pm, or by appointment,
in room CCSB G.0512. - Sheikh Motahar Naim, email snaim@miners.utep.edu,
office hours Tuesday 11-11:30 am and 3-4 pm, or by appointment,
in room CCSB G.0512.
Home assignments
Resources
- Spring 2016 CS 3350 class Web page
- V. Kreinovich, A. Lakeyev, J. Rohn, and P. Kahl, "The notions of feasibility and NP-hardness: brief introduction", Chapter 2 from "Computational complexity and feasibility of data processing and interval computations", Kluwer, Dordrecht, 1997. pdf file
- Feasible and NP: slides
Tests
Quizzes
Department of Computer Science | The University of Texas at El Paso