✦ LIBER ✦

A note on the complexity of local search problems

✍ Scribed by S.T. Fischer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Boolean Constraint Sat

✍ Philippe Chapdelaine; Nadia Creignou 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 124 KB

The complexity of Boolean constraint sat

✍ Philippe Chapdelaine; Nadia Creignou 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 129 KB

A note on the descriptive complexity of

✍ Pierluigi Crescenzi; Riccardo Silvestri 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Note: A local-search heuristic for large

✍ Larry W. Jacobs; Michael J. Brusco 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB

On the Complexity of Local Search for th

✍ Papadimitriou, Christos H.; Steiglitz, Kenneth 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 894 KB

On the Quantum Query Complexity of Local

✍ Xiaoming Sun; Andrew Chi-Chih Yao 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 539 KB