Discover open access scientific publications

Search, annotate, share and cite publications

Publications by Amnon Ta-Shma

If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2007English

Related publications

Distinguishing Easy and Hard Instances

2002English

Hard and Easy Instances of L-Tromino Tilings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Monocultures Are Hard to Find in Practice

IEEE Security and Privacy
Computer NetworksElectronic EngineeringLawElectricalCommunications
2003English

Automating Resolution Is NP-Hard

2019English

Optimizing Pred(25) Is NP-Hard

Studies in Systems, Decision and Control
ControlSystems EngineeringFinanceAutomotive EngineeringDecision SciencesEconomicsEconometricsOptimizationComputer ScienceSocial Sciences
2017English

Computing the Interleaving Distance Is NP-Hard

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2019English

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1999English

Tile-Packing Tomography Is $\Mathbb{NP}$ -Hard

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2011English

Maximum Algebraic Connectivity Augmentation Is NP-hard

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy