1795 search results - page 13 / 359 » On the Complexity of Circuit Satisfiability |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
DATE
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...