Sciweavers

1383 search results - page 141 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
ECCC
2008
98views more  ECCC 2008»
15 years 6 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
15 years 6 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 6 months ago
Guessing Facets: Polytope Structure and Improved LP Decoder
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
Alexandros G. Dimakis, Martin J. Wainwright
JAIR
2006
87views more  JAIR 2006»
15 years 6 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
DAM
2007
120views more  DAM 2007»
15 years 6 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot