Sciweavers

4355 search results - page 12 / 871
» Increasing Kolmogorov Complexity
Sort
View
ICALP
2009
Springer
14 years 8 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
ASIACRYPT
1999
Springer
14 years 26 days ago
Linear Complexity versus Pseudorandomness: On Beth and Dai's Result
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
Yongge Wang
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
14 years 1 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
ECAL
2007
Springer
14 years 2 months ago
Increasing Complexity Can Increase Stability in a Self-Regulating Ecosystem
A long standing debate within ecology is to what extent ecosystem complexity and stability are related. Landmark theoretical studies claimed that the more complex an ecosystem, the...
James Dyke, Jamie McDonald-Gibson, Ezequiel A. Di ...
ICC
2007
IEEE
109views Communications» more  ICC 2007»
14 years 2 months ago
A Robust Kolmogorov-Smirnov Detector for Misbehavior in IEEE 802.11 DCF
— The CSMA/CA protocols are designed under the assumption that all participant nodes would abide to the protocol rules. This is of particular importance in distributed protocols ...
Alberto López Toledo, Xiaodong Wang