1795 search results - page 270 / 359 » On the Complexity of Circuit Satisfiability |
72
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
With the proliferation of data APIs, it is not uncommon that users who have no clear ideas about data APIs will encounter difficulties to build Mashups to satisfy their requiremen...
116
Voted
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
104
Voted
CADE
2006
Springer
16 years 29 days ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
91
Voted
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
188
Voted
SIGMOD
2007
ACM
16 years 24 days ago
2007
ACM
XML is the data interoperability standard in many application domains. Therefore, an increasing number of researchers and professionals, who are not computer scientists (although ...