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.
2015
2015
Fixed Points of Modified -Contractive Mappings in Complete Metric-Like Spaces
We introduce the notion of modified -contractive mappings in the setting of complete metric-like spaces and we investigate the… 
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… 
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… 
2001
2001
Screening in a Matching Market
Contract design under incomplete information is often analysed in a bilaterally monopolistic setting. If the informed party's… 
Highly Cited
2000
Highly Cited
2000
The technological mediation of the nursing-medical boundary
Norwegian medical emergency communication (AMK) centres are staffed by nurses, who administer requests for ambulance services or… 
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… 
Highly Cited
1998
Highly Cited
1998
Problem solving during artificial selection of self-replicating loops
1996
1996
A Formal Approach for Horizontal Fragmentation in Distributed Deductive Database Design
Fragmentation of base relations in a distributed database management system increases the level of concurrency and therefore… 
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… 
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)