1199 search results - page 179 / 240 » Parameterized Proof Complexity |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
SPE
2011
13 years 3 months ago
2011
Abstract. Two methods have been identified for Event-B model decomposition: shared variable and shared event. The purpose of this paper is to introduce the two approaches and the ...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— We target M-ary data sequence estimation over time-variant frequency selective fading channels subject to cochannel interference (CCI). A novel joint reduced state sequence est...
APSEC
2006
IEEE
14 years 2 months ago
2006
IEEE
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...