Constraint and Consequence
 
   
  Craig Holman   Research   Quotations   Contact
 
  Home > Research
 
 
 

Jabberwocky

  Jabberwocky, by Lewis Carroll

 

I've been happily conducting research on algorithms for challenging problems for more than twenty years. I finally decided to get some of my results out into the world and will be writing up this work in this blog.

 

Snicker-snack!

 
  I'm posting lightly because I'm very distracted by research progress on Graph Isomorphism.

  Today
 
  May 2008     June 2008     July 2008    
 
  Topics
 
 
 

Recent entries

080709 Still distracted by research, but progress, and lagniappe
080709 Distracted by research and lagniappe
080705 The Adaptive Market Patern - Agents
080704 An unpublished letter to the editor on gay marriage - November 2004
080703 Algorithm Description - The art of presenting algorithms
080701 A bizarre interruption - Problems updating this site - Resolved
080701 150th birthday of Natural Selection - Year of Darwin begins
080622 The Adaptive Market Pattern - A first pass at a framework - Part 1
080621 The Adaptive Market Pattern - An introduction
080620 Proof that the elegance transformations are a complete set of reductions
080619 Maximalizing cliques
080618 Maximal matchings and the construction of cliques
080617 The k-reduction of graphs
080615 Calculating the maximum number of CNF and DNF clauses for an expression
080615 Problem-solving systems
080614 Algorithms for the Constraint Calculus
080613 A sample run of the Reduce to Elegance algorithm
080612 Towards a problem-solving service
080611 Graph Isomorphism Algorithm Timings
080610 Boolean Expressions - The Reduce To Elegance Algorithm
080609 Boolean Expressions - Elegant Normal Form
080608 Post to Graphs at YahooGroups.com regarding my Graph Isomorphism work
080608 The Reduction of Constraint Trees
080607 Boolean Expressions - An Overview
080605 Boolean Expressions - The Constraint Calculus
080604 The MaximalSetSet Class
080603 Some Favorite Problems
080602 Maximal Cliques - Split Approach
080602 Maximum Cliques - Split Approach
080602 Maximum Clique Size - Split Approach
080602 k-Clique Exists - Split Approach
080601 Some research themes
080601 Highlights of my doctoral dissertation
080531 What is it? An explanation of the spinning cluster of points on the main page
080531 The Search Approach to the k-Clique Exists problem - Introduction to the Text
080530 Maximal Cliques - An example of the Split Completely algorithm
080529 The Netflix Prize - Corated movies revisited
080528 The Netflix Prize
080527 Two identities from the structure of the n-th power of integers
080527 The search approach to the k-Clique Exists problem
080526 An alternative version of the Riemann Hypothesis, with observations and ideas
080526 Maximal cliques

 
 
 
  Home > Research
 
  Craig Holman   Research   Quotations   Contact   Copyright and Legal Notices
 
 
 
  Patterncraft™ and Constraint and Consequence™
are trademarks of Craig Stewart Holman

Copyright © 2008 Craig Stewart Holman

All Rights Reserved.