Skip to search formSkip to main contentSkip to account menu

P-complete

Known as: CVP, PTIME-hard, Circuit value problem 
In complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
In this paper we consider the question of sensor network coverage for a two-dimensional domain. We seek to compute the… 
1999
1999
A heuristic method (computation of weighted averages) is considered for risk analysis. It is improved upon by utilizing the… 
1997
1997
The bounded ILP-consistency problem for function-free Horn clauses is described as follows. Given at setE+ andE− of function-free… 
1995
1995
  • K. Ohmori
  • 1995
  • Corpus ID: 39916353
This paper reports on a genetic algorithm applied to high-level hardware synthesis. The GA generates a register transfer level… 
1990
1990
Abstract There are linear-time sequential algorithms for many fundamental problems related to digraph reachability. In contrast…