Hard Instances of Algorithms and Proof Systems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-30870-3_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Distinguishing Easy and Hard Instances

2002English

Hard and Easy Instances of L-Tromino Tilings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

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

International Journal of Applied Evolutionary Computation
2014English

The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms

Journal of Mathematical Modelling and Algorithms
2005English

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

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

Method of Proof of Work Consensus Algorithms Comparison

Radiotekhnika
2019English

Probabilistic Proof Systems

BRICS Report Series
1994English

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

On Helping and Interactive Proof Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy