scientific article; zbMATH DE number 5914170

MaRDI QIDQ3011193zbMATH OpenFDO

Authors C. Iwamoto, Yusuke Sumida

Publication date 28 June 2011

Full work available at URL http://pphmj.com/abstract/5714.htm

zbMATH Keywords

one-person gamepolynomial-time reduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Game theory (91A99)

Recommendations

• Solving parity games by a reduction to SAT
• A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
• A perspective on certain polynomial-time solvable classes of satisfiability
• SAT-Problems and Reductions with Respect to the Number of Variables
• A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem
• A time lower bound for satisfiability
• Automata, Languages and Programming
• A note on SAT algorithms and proof complexity
• scientific article; zbMATH DE number 1342213
• Fixed-parameter tractable reductions to SAT

Cited in

(1)

• A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem

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 Q3011193)