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
2013
2013
Multidimensional Fixed-Point Theorems in Partially Ordered Complete Partial Metric Spaces under ()-Contractivity Conditions
We study the existence and uniqueness of coincidence point for nonlinear mappings of any number of arguments under a weak… 
Review
2011
Review
2011
Queries and materialized views on probabilistic databases
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… 
2005
2005
Behavioural Equivalences on Finite-State Systems are PTIME-hard
The paper shows a LOGSPACE-reduction from the Boolean circuit value problem which demonstrates that any relation subsuming… 
2004
2004
On the hardness of counting problems of complete mappings
2004
2004
The Complexity of Satisfiability Problems over Finite Lattices
We study the computational complexity of problems defined by formulas over fixed finite lattices. We consider evaluation… 
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… 
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)