Skip to search formSkip to main contentSkip to account menu

Co-NP-complete

Known as: CoNP-complete 
In complexity theory, computational problems that are co-NP-complete are those that are the hardest problems in co-NP, in the sense that any problem… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Conceptual tools are developed to aid in crafting a theory of scheduling complex computation-dags for Internet-based computing… 
2003
2003
This note revisits the maximum deviation just-in-time (MDJIT) scheduling problem previously investigated by Steiner and Yeomans… 
2000
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP… 
2000
2000
Abstract.The classes of P-, P0-, R0-, semimonotone, strictly semimonotone, column sufficient, and nondegenerate matrices play… 
2000
2000
In this paper we study a rather generic communication/ coordination/ computation problem: in a finite network of agents, each… 
1991
1991
F.P. Preparata et al. (1967) introduced a graph-theoretical model for fault diagnosis called the PMC model. The question of…