1795 search results - page 52 / 359 » On the Complexity of Circuit Satisfiability |
ACTA
2004
13 years 8 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
IJBC
2008
13 years 8 months ago
2008
Intermittent instability is commonly observed in switching power supplies during the design and development phase. It manifests as symmetrical period-doubling bifurcation in the ti...
DAM
2002
13 years 8 months ago
2002
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...