Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.68393OpenAlexW2494705596MaRDI QIDQ5492895FDOQ5492895

Authors: Fredrik Kuivinen 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Recommendations

• Inapproximability results for equations over infinite groups
• Approximability of the Maximum Solution Problem for Certain Families of Algebras
• Inapproximability results for equations over finite groups
• scientific article; zbMATH DE number 2086612
• On the hardness of approximating max-satisfy

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (6)

• Approximability of clausal constraints
• Inapproximability results for equations over infinite groups
• Introduction to the Maximum Solution Problem
• Approximability of the Maximum Solution Problem for Certain Families of Algebras
• Inapproximability results for equations over finite groups
• Title not available (Why is that?)

This page was built for publication: Mathematical Foundations of Computer Science 2005

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