Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Carlos F. Gaona
Hard and Easy Instances of L-Tromino Tilings
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Distinguishing Easy and Hard Instances
If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Hard Instances of Algorithms and Proof Systems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Hard to Reach: Easy to Omit
Primary Care Respiratory Journal
Easy Solutions of Hard to Handle Reagents
Chemical and Engineering News
Chemical Engineering
Solution of “Hard” Knapsack Instances Using Quantum Inspired Evolutionary Algorithm
International Journal of Applied Evolutionary Computation
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty
Journal of Artificial Intelligence Research
Artificial Intelligence
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
