508 search results - page 54 / 102 » Quantum Computers |
FUIN
2008
13 years 11 months ago
2008
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
QCQC
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
JCC
2007
13 years 11 months ago
2007
Abstract: The relative aromaticity of benzenoid rings in the linear polyacenes is investigated using two novel aromaticity approaches. According to the first, the aromaticity of i...
ISMVL
2008
IEEE
14 years 5 months ago
2008
IEEE
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...