6274 search results - page 86 / 1255 » From query complexity to computational complexity |
89
Voted
ISMVL
2005
IEEE
15 years 8 months ago
2005
IEEE
In digital signal processing, we often use higher radix system to achieve high-speed computation. In such cases, we require radix converters. This paper considers the design of LU...
93
Voted
DSD
2002
IEEE
15 years 7 months ago
2002
IEEE
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...
138
Voted
IJFCS
2008
15 years 2 months ago
2008
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
113
Voted
ECCC
2002
15 years 2 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
157
Voted
PODC
2012
ACM
13 years 5 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...