1. Applications of types of SATs Arash Ahadi 2013

2. What is SAT?

5. What is SAT Problem?

7. SAT is NP-complete

8. Why 3-SAT is useful?

9. An example (in Computational Geometry)

10. An important open problem

11. Sketch of Proof

17. Types of SAT Why do we need another types of SATs?

18. Answer by several examples

20. Sketch of Proof

23. Planar 3-SAT

24. Other types and examples?!!

25. Labeling of Graphs: Lucky labeling

26. Existance

27. Hardness

28. Sketch of Proof

30. What about every k >1?

31. Main Reference

32. Another type Not All Equal SAT

33. Labeling of Graphs: Sigma labeling

34. The Relationship between Lucky & Sigma

35. They are very different

36. Relationship to Chromatic Number

37. Complexity for 3-regular graphs

38. Sketch of Proof

40. Complexity for every k

41. Minimizing the size of a Part

46. Conclusion

47. The Others

48. Proper Labeling Problems A.Ahadi and A. Dehghan, Journal of Theoretical Computer Science, in appears.

49. Edge Labeling by Sum

50. Proper Labeling Problems

51. Edge Labeling by Product

52. Vertex Labeling by Product

53. Edge Labeling by Gap

56. Vertex Labeling by Gap

58. Polynomial Algorithm

59. Fractional Coloring

61. The Results (in labelings)

62. There are several another theorems…

63. Thanks