106 search results - page 11 / 22 » A logic you can count on |
180
click to vote
JAPLL
2006
15 years 6 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
161
click to vote
ERSA
2003
15 years 7 months ago
2003
The availability of SiGe HBT devices has opened a door for Gigahertz FPGAs. However, the large device power consumption limits its scale. In order to solve this problem, a Multipl...
166
Voted
GLVLSI
2007
IEEE
16 years 12 days ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
143
click to vote
JAPLL
2008
15 years 6 months ago
2008
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...
164
click to vote
ACMSE
2000
ACM
15 years 10 months ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...