⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

January 1, 1977RAIRO Informatique théoriqueOpen Access

Reducibility as a tool to extend the power of approximation algorithms the minimization of boolean expressions

Aldo Aiello Ernesto Burattini A. Massarotti

View Full Paper

Ask AI

Bookmark

Share

No abstract yet

We only have this paper's title and publication details.

Read it at the source→

Abstract

Communicated by

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Aiello et al. (1977) studied this question.

synapsesocial.com/papers/6a21d6247a665884467c2cf6 https://doi.org/10.1051/ita/1977110100751

View Full Paper

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1The complexity of theorem-proving proceduresOriginal Research · 1971 · 6,385 citations
2Approximation algorithms for combinatorial problemsOriginal Research · 1973 · 272 citations
3Computationally Related ProblemsOriginal Research · 1974 · 364 citations
4P-complete problems and approximate solutionsOriginal Research · 1974 · 41 citations
5Polynomial complete scheduling problemsOriginal Research · 1973 · 85 citations

More from RAIRO Informatique théorique

Rebalancing operations for deletions in AVL-treesTue,
Computing the connected components of simple rectilinear geometrical objects in d-spaceSun,
A new class of balanced search trees : half-balanced binary search tressFri,