article

How easy is local search?

Authors:

David S. Johnson,

Christos H. Papadimtriou,

Mihalis YannakakisAuthors Info & Claims

Journal of Computer and System Sciences, Volume 37, Issue 1

Pages 79 - 100

https://doi.org/10.1016/0022-0000(88)90046-3

Published: 01 August 1988 Publication History

Abstract

No abstract available.

Cited By

View all

Deligkas AEiben EGoldsmith TDastani MSichman JAlechina NDignum V(2024)The Parameterized Complexity of Welfare Guarantees in Schelling SegregationProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662892(425-433)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662892
Göös MHollender AJain SMaystre GPires WRobere RTao R(2024)Separations in Proof Complexity and TFNPJournal of the ACM10.1145/366375871:4(1-45)Online publication date: 9-May-2024
https://dl.acm.org/doi/10.1145/3663758
Gharibian S(2024)Guest Column: The 7 faces of quantum NPACM SIGACT News10.1145/3639528.363953554:4(54-91)Online publication date: 3-Jan-2024
https://dl.acm.org/doi/10.1145/3639528.3639535
Show More Cited By

Index Terms

How easy is local search?
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Journal of Computer and System Sciences

Journal of Computer and System Sciences Volume 37, Issue 1

26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985

August 1988

115 pages

ISSN:0022-0000

Editor:
E. K. Blum

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 August 1988

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

193
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Deligkas AEiben EGoldsmith TDastani MSichman JAlechina NDignum V(2024)The Parameterized Complexity of Welfare Guarantees in Schelling SegregationProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662892(425-433)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662892
Göös MHollender AJain SMaystre GPires WRobere RTao R(2024)Separations in Proof Complexity and TFNPJournal of the ACM10.1145/366375871:4(1-45)Online publication date: 9-May-2024
https://dl.acm.org/doi/10.1145/3663758
Gharibian S(2024)Guest Column: The 7 faces of quantum NPACM SIGACT News10.1145/3639528.363953554:4(54-91)Online publication date: 3-Jan-2024
https://dl.acm.org/doi/10.1145/3639528.3639535
Fleming NGrosser SPitassi TRobere RMohar BShinkar IO'Donnell R(2024)Black-Box PPP Is Not Turing-ClosedProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649769(1405-1414)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649769
Fearnley JGoldberg PHollender ASavani RMohar BShinkar IO'Donnell R(2024)The Complexity of Computing KKT Solutions of Quadratic ProgramsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649647(892-903)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649647
Filos-Ratsikas AHansen KHøgh KHollender AMohar BShinkar IO'Donnell R(2024)PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex OptimizationProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649645(1204-1215)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649645
Chen XLi YYannakakis MMohar BShinkar IO'Donnell R(2024)Computing a Fixed Point of Contraction Maps in Polynomial QueriesProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649623(1364-1373)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649623
Aissi HMahjoub A(2024)On the minimum cut problem with budget constraintsMathematical Programming: Series A and B10.1007/s10107-023-01987-9203:1-2(421-442)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s10107-023-01987-9
Hao BMichini C(2024)The price of Anarchy in series-parallel network congestion gamesMathematical Programming: Series A and B10.1007/s10107-022-01803-w203:1-2(499-529)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s10107-022-01803-w
Li JDeng XCheng YPan YXia XYang ZXie JAgmon NAn BRicci AYeoh W(2023)Altruism, Collectivism and Egalitarianism: On a Variety of Prosocial Behaviors in Binary Networked Public Goods GamesProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems10.5555/3545946.3598691(609-624)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.5555/3545946.3598691
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Easy Mac Computer Basics

Easy Computer Basics (Easy)

Easy mac® os x leopard™

Comments

Published In

Publisher

Publication History

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

Cited By

Index Terms

Recommendations

Easy Mac Computer Basics

Easy Computer Basics (Easy)

Easy mac® os x leopard™

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations