4781 search results - page 11 / 957 » Complexity at large |
CIE
2010
Springer
14 years 11 days ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
ICDCS
2007
IEEE
2007
IEEE
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
14 years 1 months ago
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
- In general, fault dictionary is prevented from practical applications for its extremely large size. Several previous works are proposed for the fault dictionary size reduction. H...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Over the past decades, large organisations have developed increasingly complex portfolios of information systems to support business processes. Maintenance and leveraging of these...