![The Topsy-Turvy World of Continued Fractions [online]](http://s1.studyres.com/store/data/013517122_1-37fbec74007e47f2943196e6a0a15c3d-300x300.png)
Counting Set Covers and Split Graphs
... theory terminology and background, the books of Diestel [2] and West [6] are recommended. A graph is chordal (or triangulated) if it has no cycle of length 4 or greater as an induced subgraph. Chordal graphs form an important class of graphs, and have been extensively studied, particularly with resp ...
... theory terminology and background, the books of Diestel [2] and West [6] are recommended. A graph is chordal (or triangulated) if it has no cycle of length 4 or greater as an induced subgraph. Chordal graphs form an important class of graphs, and have been extensively studied, particularly with resp ...
A Polynomial Time Algorithm for Prime Recognition
... Agrawal, Kayal and Saxena of the Indian Institute of Technology in Kanpur, published their breakthrough on the Internet in a preliminary paper in August 2002. They found (and proved valid) a deterministic algorithm for primality testing that executes in polynomial time. This was a major breakthrough ...
... Agrawal, Kayal and Saxena of the Indian Institute of Technology in Kanpur, published their breakthrough on the Internet in a preliminary paper in August 2002. They found (and proved valid) a deterministic algorithm for primality testing that executes in polynomial time. This was a major breakthrough ...
