29908 search results - page 43 / 5982 » On the Complexity of |
SIGMOD
2010
ACM
13 years 8 months ago
2010
ACM
The problem of efficiently evaluating a large collection of complex Boolean expressions
CC
2010
Springer
13 years 7 months ago
2010
Springer
We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
JCC
2006
13 years 7 months ago
2006
: Based on our previous study for the O2 binding of the Fe
ECCC
2007
13 years 7 months ago
2007
Abstract. Motivated by a study of Zimand (22nd CCC, 2007), we consider the average-case complexity of property testing (focusing, for clarity, on testing properties of Boolean stri...