✦ LIBER ✦

On the complexity of a family related to the Legendre symbol

✍ Scribed by Katalin Gyarmati

Publisher: Springer Netherlands
Year: 2009
Tongue: English
Weight: 129 KB
Volume: 58
Category: Article
ISSN: 0031-5303
DOI: 10.1007/s10998-009-10209-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Estimate of a multiple sum involving the

Estimate of a multiple sum involving the legendre symbol

✍ G. I. Perel'muter 📂 Article 📅 1975 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 259 KB

A generalization of the Legendre symbol

A generalization of the Legendre symbol for finite Abelian groups

✍ Philippe Delsarte 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 525 KB

A family of distributions related to the

A family of distributions related to the McCullagh family

✍ V. Seshadri 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 300 KB

On the complexity of a family of general

On the complexity of a family of generalized matching problems

✍ Ten-Hwang Lai; Alan Sprague 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 787 KB

Estimate of a multidimensional sum with

Estimate of a multidimensional sum with the Legendre symbol for a polynomial of odd degree

✍ G. I. Perel'muter 📂 Article 📅 1976 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 399 KB

A note on the complexity of family sched

A note on the complexity of family scheduling to minimize the number of late jobs

✍ T. C. Edwin Cheng; Zhaohui Liu; Yakov M. Shafransky 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 65 KB 👁 2 views

The single-machine family scheduling problem of minimizing the number of late jobs has been known to be NP-hard, but whether it is NP-hard in the strong sense is cited as an open problem in several reviews. In this note, we prove that this problem is strongly NP-hard even if all set-up times and pro