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
Correlation between Peripheral Venous Pressure and Central Venous Pressure Monitored by CVP Manometer : an Observational Study
Background: Central Venous Pressure (CVP) measurement is used to assess intravascular status. But today complicated procedures… 
2014
2014
Counting cliques and clique covers in random graphs
We study the problem of counting the number of isomorphic copies of a given template graph, say H, in the input base graph, say G… 
2014
2014
Scan Scheduling Specification and Analysis
We investigate the construction of fixed schedules for an EW receiver that ensures that n disjoint frequency bands are… 
2009
2009
Technical Report Incremental Test Generation Guided by Fault Coverage Table of Contents
2007
2007
Inconsistent Ontology Handling by Translating Description Logics into Defeasible Logic Programming
The Semantic Web is a future vision of the web where stored information has exact meaning, thus enabling computers to understand… 
2005
2005
On Complexity of Counting Fixed Point Configurations in Certain Classes of Graph Automata
We study computational complexity of counting the fixed point configurations (FPs) in certain discrete dynamical systems. We… 
1999
1999
Risk Analysis Using Perceptions and Quadratic Programming
A heuristic method (computation of weighted averages) is considered for risk analysis. It is improved upon by utilizing the… 
1997
1997
A new heuristic algorithm for estimating signal and detection probabilities
The problem of computing signal probabilities of digital circuits arises in the context of random testing, pseudorandom testing… 
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… 
1974
1974
P-Complete Problems and Approximate Solutions
We study the class of P-Complete problems and show the following: i) for any constant e ≫0 there is a P-complete problem for… 
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)