2273 search results - page 17 / 455 » On the Expressiveness and Complexity of ATL |
EJC
2010
13 years 8 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
FPGA
2009
ACM
14 years 3 months ago
2009
ACM
This paper describes a bus mastering implementation of the PCI Express protocol using a Xilinx FPGA. While the theoretical peak performance of PCI Express is quite high, attaining...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
AISC
2006
Springer
14 years 5 days ago
2006
Springer
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
ISVLSI
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incomplet...