1795 search results - page 212 / 359 » On the Complexity of Circuit Satisfiability |
ICSE
2000
IEEE-ACM
14 years 1 months ago
2000
IEEE-ACM
This paper, in the first chapter summarizes the state of the art in SCM, showing the evolution along the last 25 years. Chapter 2 shows the current issues and current research wor...
WDAG
1995
Springer
14 years 1 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
AAAI
2008
14 years 16 days ago
2008
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
AAAI
2008
14 years 16 days ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
ASPDAC
2008
ACM
14 years 6 days ago
2008
ACM
- In the design process of a reconfigurable accelerator employing in an embedded system, multitude parameters may result in remarkable complexity and a large design space. Design s...