STOC 1996 - PDF Preprint Papers

STOC 1996 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-1996 Paper

click to vote

STOC
1996
ACM

197views Algorithms» more STOC 1996»

Computing Betti Numbers via Combinatorial Laplacians

14 years 3 months ago

Download www.math.ubc.ca

We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...

Joel Friedman

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	197	Computing Betti Numbers via Combinatorial Laplacians	claim
2	185	Adaptively Secure Multi-Party Computation	claim
3	132	Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine	claim
4	125	Modular Coloring Formulas Are Hard for Cutting Planes Proofs	claim
5	118	Towards an Analysis of Local Optimization Algorithms	claim
6	118	Characterizing Linear Size Circuits in Terms of Privacy	claim
7	115	Minimum Cuts in Near-Linear Time	claim
8	104	On the Boosting Ability of Top-Down Decision Tree Learning Algorithms	claim
9	101	The Space Complexity of Approximating the Frequency Moments	claim
10	101	Efficient Algorithms for Inverting Evolution	claim
11	100	The Linear-Array Conjecture in Communication Complexity is False	claim
12	97	Deterministic Restrictions in Circuit Complexity	claim
13	95	Pushing Disks Together - The Continuous-Motion Case	claim
14	92	Constructing Evolutionary Trees in the Presence of Polymorphic Characters	claim
15	86	Modular Competitiveness for Distributed Algorithms	claim
16	83	Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs	claim
17	82	Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow	claim
18	78	Non-Expansive Hashing	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers