740 search results - page 12 / 148 » Lower bounds for Buchsbaum* complexes |
COCO
1995
Springer
15 years 3 months ago
1995
Springer
FOCS
1991
IEEE
15 years 3 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
IMECS
2007
15 years 1 months ago
2007
FAW
2009
Springer
15 years 4 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
ENTCS
2000
14 years 11 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...