scientific article; zbMATH DE number 1206043

zbMATH Open0904.68079MaRDI QIDQ4209084FDOQ4209084

Authors: R. I. Freidzon 

Publication date: 14 October 1998

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

Recommendations

• scientific article; zbMATH DE number 3915621
• scientific article; zbMATH DE number 3902037
• scientific article; zbMATH DE number 1953201
• An introduction to exponential time exact algorithms for solving NP-hard problems
• Approximation algorithms for NP-hard problems.

zbMATH Keywords

NP-hard problemsMaslov's iterative method of search reduction

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximation algorithms for NP-hard problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• In some curved spaces, one can solve NP-hard problems in polynomial time
• A study on the efficient approximation algorithms for NP-complete problems

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