[comp.ai.philosophy] What is `maximal clique' technique? - RESPOST

G.Joly@cs.ucl.ac.uk (11/15/90)

Note in passing that Penrose discusses a related topic (to
cliques ) in "The Emperor's New Mind". In the chapter titled
"Truth, Proof and Insight" he reviews, P, NP and NP-completeness,
and give as an example (in graph theory), the complexity theory
concerned with a hamiltonian circuit.

G.Joly@cs.ucl.ac.uk (Gordon Joly) (11/15/90)

Note in passing that Penrose discusses a related topic (to cliques )
in "The Emperor's New Mind". In the chapter titled "Truth, Proof and
Insight" he reviews, P, NP and NP-completeness, and give as an example
(in graph theory), the complexity theory concerned with a Hamiltonian
circuit.


Gordon Joly                                           +44 71 387 7050 ext 3716
InterNet: G.Joly@cs.ucl.ac.uk       UUCP: ...!{uunet.uu.net,ukc}!ucl-cs!G.Joly
Computer Science, University College London, Gower Street, LONDON WC1E 6BT, UK