Artificial Intelligence, Volume 81

Volume 81, Numbers 1-2, March 1996

• Tad Hogg, Bernardo A. Huberman, Colin P. Williams:
  Phase Transitions and the Search Problem. 1-15
  
• Bart Selman, David G. Mitchell, Hector J. Levesque:
  Generating Hard Satisfiability Problems. 17-29
  
• James M. Crawford, Larry D. Auton:
  Experimental Results on the Crossover Point in Random 3-SAT. 31-57
  
• Ian P. Gent, Toby Walsh:
  The Satisfiability Constraint Gap. 59-80
  
• Patrick Prosser:
  An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems. 81-109
  
• David G. Mitchell, Hector J. Levesque:
  Some Pitfalls for Experimenters with Random SAT. 111-125
  
• Tad Hogg:
  Refining the Phase Transition in Combinatorial Search. 127-154
  
• Barbara M. Smith, Martin E. Dyer:
  Locating the Phase Transition in Binary Constraint Satisfaction Problems. 155-181
  
• Jon W. Freeman:
  Hard Random 3-SAT Problems and the Davis-Putnam Procedure. 183-198
  
• Robert Schrag, James M. Crawford:
  Implicates and Prime Implicates in Random 3-SAT. 199-222
  
• Weixiong Zhang, Richard E. Korf:
  A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem. 223-239
  
• Tom Bylander:
  A Probabilistic Analysis of Propositional STRIPS Planning. 241-271
  
• Bart Selman, Scott Kirkpatrick:
  Critical Behavior in the Computational Cost of Satisfiability Testing. 273-295
  
• Joseph C. Pemberton, Weixiong Zhang:
  Epsilon-Transformation: Exploiting Phase Transitions to Solve Combinatorial Optimization Problems. 297-325
  
• Scott H. Clearwater, Tad Hogg:
  Problem Structure Heuristics and Scaling Behavior for Genetic Algorithms. 327-347