740 search results - page 76 / 148 » Lower bounds for Buchsbaum* complexes |
190
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
148
click to vote
FSTTCS
2004
Springer
16 years 4 days ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
273
click to vote
ACID
2006
15 years 8 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
214
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
152
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...