Virtual University

Introduction (V-U)

Subset Sum Problem, Satisfiability (V-U)

Interpolation (Newton’s Forward and Backward Difference Interpolation Formulae) (V-U)

Linear Bounded Automata, Computation Histories, Context Free Grammars (V-U)

The Class NP (Cont.) (V-U)

Introduction to MAPLE, Symbolic Computations (V-U)

Logical Theories (Cont.) (V-U)

The Class NP (Cont.), Polynomial Time Verifiers (V-U)

Absolute value Function (V-U)

Introduction to Numerical Methods (V-U)

Logical Theories (Cont.), Godel's Theorem (V-U)

The Cook-Levin Theorem (V-U)

Application: Compactness and Homomorphism (V-U)

Muller's Method (V-U)

LOGSPACE Transducer (V-U)

The Halting Problem, Universal TM (V-U)

Application: Image of connected set (V-U)

Non-Deterministic Time, The Class P, The Class NP (V-U)

Newton-Cotes Integration Formulae (V-U)

The Subset Sum Problem (V-U)

Compactness and open collection (V-U)

NP-Completeness (Cont.) (V-U)

Arbitrary Intersection (V-U)

Romberg’s Integration and Double Integration (V-U)

The Traveling Salesman Problem (V-U)