Distinguishing Easy and Hard Instances

doi 10.3115/1118853.1118868
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Hard and Easy Instances of L-Tromino Tilings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

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

Hard Instances of Algorithms and Proof Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Hard to Reach: Easy to Omit

Primary Care Respiratory Journal
2011English

Easy Solutions of Hard to Handle Reagents

Chemical and Engineering News
Chemical Engineering
1983English

Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm

International Journal of Applied Evolutionary Computation
2014English

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty

Journal of Artificial Intelligence Research
Artificial Intelligence
1997English

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

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy