Skip to search formSkip to main contentSkip to account menu

Complete (complexity)

Known as: Complete problem, Hard (complexity) 
In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest… 
Wikipedia (opens in a new tab)

Related topics

Related topics

35 relations
Approximation-preserving reductionClique problemCo-NPComplexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Synthesis and Swelling Behavior of Starch-Poly (Sodium Acrylate-co-Acrylamide) Superabsorbent Hydrogel
Superabsorbent polymers based on starch (St) and polyacrylonitrile (PAN) were prepared by alkaline hydrolysis of the physical… 
2008
2008
Hyperbolic chaos in the phase dynamics of a Q-switched oscillator with delayed nonlinear feedbacks
We propose a device based on a Q-switched self-sustained oscillator with two nonlinear delayed feedback loops. Due to the… 
2002
2002
A Synthesis of Evaluation Criteria for Software Specifications and Specification Techniques
Several evaluation criteria exist in the literature for both specification and specification techniques. These evaluation… 
2000
2000
Towards a Model of Learning through Communication
Abstract. Communication is an interactive, complex, structured process involving agents that are capable of drawing conclusions… 
1999
1999
Fast allocation and deallocation with an improved buddy system
Abstract.We propose several modifications to the binary buddy system for managing dynamic allocation of memory blocks whose sizes… 
1999
1999
Learnability of quantified formulas
Highly Cited
1998
Highly Cited
1998
Problem solving during artificial selection of self-replicating loops
1989
1989
Computers and language learning: misguided assumptions
There has been a rapid increase in the availability of computer assisted instruction (CAI) software for teaching oral language… 
1988
1988
A Natural NP-Complete Problem with a Nontrivial Lower Nound
  • E. Grandjean
  • SIAM journal on computing (Print)
  • 1988
  • Corpus ID: 12313891
Let ${\operatorname{SAT}}_ < (\mathbb{N})$ denote the following problem. Instance. A conjunction $\varphi $ of (in)equalities… 
1940
1940
A MODIFIED SALICYLALDEHYDE METHOD FOR THE DETERMINATION OF ACETONE BODIES IN BLOOD AND URINE
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)