504 search results - page 43 / 101 » The Complexity of Symmetry-Breaking Formulas |
ECCC
2010
13 years 10 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
ENTCS
2007
13 years 10 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
TIT
1998
13 years 9 months ago
1998
— In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ...
STOC
2002
ACM
14 years 10 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...