Amanote Research
Register
Sign In
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions
doi 10.1145/2897518.2897539
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2016
Authors
Boris Aronov
Micha Sharir
Publisher
ACM Press
Related search
Tight Bounds for Adopt-Commit Objects
Theory of Computing Systems
Computational Theory
Theoretical Computer Science
Mathematics
Tight Bounds for Testing Bipartiteness in General Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Viscoelastic Response of Topological Tight-Binding Models in Two and Three Dimensions
Physical Review B
Tight Bounds for Parallel Randomized Load Balancing
Nearly Tight Bounds for Testing Function Isomorphism
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates
Tight Worst-Case Bounds for Polynomial Loop Programs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Tight Approximation Bounds for Greedy Frugal Coverage Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower Bounds for the Life-Span of Solutions of Nonlinear Wave Equations in Three Dimensions
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
