scientific article; zbMATH DE number 3589730

zbMATH Open0378.68033MaRDI QIDQ4157951FDOQ4157951

Authors: Thomas J. Schaefer 

Publication date: 1976

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Decision theory (91B06) Analysis of algorithms and problem complexity (68Q25)

Cited In (7)

• On polynomial time isomorphisms of some new complete sets
• Complexity of unordered CNF games
• On the complexity of chess
• NP-Complete operations research problems and approximation algorithms
• On the complexity of some two-person perfect-information games
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• Complexity of problems in games, graphs and algebraic equations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157951)