1552 search results - page 72 / 311 » On the Complexity of Constant Propagation |
187
click to vote
TSP
2010
15 years 1 months ago
2010
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...
282
click to vote
MST
2011
14 years 9 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
256
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
163
click to vote
ISAAC
2009
Springer
16 years 27 days ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
137
click to vote
CSL
2007
Springer
16 years 15 days ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....