Homework 1                         Manfred Warmuth
      290A                             Posted F, 1-21-00
    Winter 00                          Due Tu, 2-1-00
    


1. Use the sticker model to implement an algorithm
for solving an interesting problem. 
An example problem could be the satisfiability
problem (SAT) given below. 

SAT:

Input:  A Boolean formula in conjunctive normal form

Question: Does there exist an assignment that satisfies
	  the formula


Here is an example of a formula in conjunctive normal
form with 4 variables and 5 clauses.
The formula is a conjunction of clauses where each
clause is a disjunction of literals and a literal
is a variable or a negated variable.

(x1 or x3 or x4)    and    (not x1 or x3)    and    
(not x1 or x4 or not x2)    and    not x3    and    (x2 or not x4)


2. A half page description of what you want to do for a project.