Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,436,964 papers from all fields of science
Search
Sign In
Create Free Account
P-complete
Known as:
CVP
, PTIME-hard
, Circuit value problem
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
Boolean circuit
Boolean satisfiability problem
Circuit (computer science)
Complete (complexity)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Inconsistency-tolerant temporal reasoning with hierarchical information
N. Kamide
Information Sciences
2015
Corpus ID: 32376468
2011
2011
Failure filtrations for fenced sensor networks
E. Munch
,
M. Shapiro
,
J. Harer
Int. J. Robotics Res.
2011
Corpus ID: 18331596
In this paper we consider the question of sensor network coverage for a two-dimensional domain. We seek to compute the…
Expand
2004
2004
On the hardness of counting problems of complete mappings
J. Hsiang
,
D.Frank Hsu
,
Yuh-Pyng Shieh
Discrete Mathematics
2004
Corpus ID: 37687228
1999
1999
Risk Analysis Using Perceptions and Quadratic Programming
B. Falkowski
Fuzzy Days
1999
Corpus ID: 37628792
A heuristic method (computation of weighted averages) is considered for risk analysis. It is improved upon by utilizing the…
Expand
1997
1997
On the complexity of some inductive logic programming problems
G. Gottlob
,
N. Leone
,
Francesco Scarcello
New generation computing
1997
Corpus ID: 1895934
The bounded ILP-consistency problem for function-free Horn clauses is described as follows. Given at setE+ andE− of function-free…
Expand
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…
Expand
1995
1995
A Parallel Decoding Algorithm for LZ2 Data Compression
S. Agostino
Parallel Computing
1995
Corpus ID: 857190
1990
1990
Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs
M. Kao
,
P. Klein
Symposium on the Theory of Computing
1990
Corpus ID: 9776181
Abstract There are linear-time sequential algorithms for many fundamental problems related to digraph reachability. In contrast…
Expand
1989
1989
On the Logic of Unification
Philippe le Chenadec
Journal of symbolic computation
1989
Corpus ID: 1789578
Highly Cited
1988
Highly Cited
1988
Parallel Approximation Algorithms for Bin Packing
Richard J. Anderson
,
E. Mayr
,
Manfred K. Warmuth
Information and Computation
1988
Corpus ID: 14934001
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)
ACCEPT & CONTINUE