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)

Related topics

Related topics

36 relations
Boolean circuitBoolean satisfiability problemCircuit (computer science)Complete (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Inconsistency-tolerant temporal reasoning with hierarchical information
2011
2011
Failure filtrations for fenced sensor networks
In this paper we consider the question of sensor network coverage for a two-dimensional domain. We seek to compute the… 
2004
2004
On the hardness of counting problems of complete mappings
2004
2004
Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard
1997
1997
On the complexity of some inductive logic programming problems
The bounded ILP-consistency problem for function-free Horn clauses is described as follows. Given at setE+ andE− of function-free… 
1995
1995
High-level synthesis using genetic algorithm
  • K. Ohmori
  • Proceedings of IEEE International Conference on…
  • 1995
  • Corpus ID: 39916353
This paper reports on a genetic algorithm applied to high-level hardware synthesis. The GA generates a register transfer level… 
1995
1995
A Parallel Decoding Algorithm for LZ2 Data Compression
1990
1990
Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs
Abstract There are linear-time sequential algorithms for many fundamental problems related to digraph reachability. In contrast… 
1989
1989
On the Logic of Unification
Highly Cited
1988
Highly Cited
1988
Parallel Approximation Algorithms for Bin Packing
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)