Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

108

Voted

EJC
2011

204views Information Technology» more EJC 2011»

Lower bounds for Buchsbaum* complexes

14 years 10 months ago

Lower bounds for Buchsbaum* complexes

Download users.uoa.gr

Jonathan Browder, Steven Klee

Real-time Traffic

EJC 2011 | Information Technology |

claim paper

Related Content

» Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions

» Lower bounds for numberinhand multiparty communication complexity made easy

» A NearTight Lower Bound on the Time Complexity of Distributed MinimumWeight Spanning Tree ...

» Cosmological lower bound on the circuit complexity of a small problem in logic

» An Optimal Lower Bound on the Communication Complexity of GapHammingDistance

» Query Complexity Lower Bounds for Reconstruction of Codes

» An improved lower bound for the time complexity of mutual exclusion

» Some Lower Bounds for the Complexity of Continuation Methods

» Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	EJC
Authors	Jonathan Browder, Steven Klee

Comments (0)