740 search results - page 7 / 148 » Lower bounds for Buchsbaum* complexes |
DCG
2008
14 years 11 months ago
2008
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...
110
click to vote
COCO
2001
Springer
15 years 4 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
124
click to vote
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
ALT
1998
Springer
15 years 4 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
DLT
2006
15 years 1 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...