Similar Papers

Paper Title
Journal
Date
Author
Modelling and control of discrete event manufacturing flow lines
-
18 Nov 2015
A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels
Marco Tomamichel ... Vincent Y F Tan
IEEE Transactions on Information Theory | VOL. 59
Marco Tomamichel, et. al.Marco Tomamichel ... Vincent Y F Tan
24 Oct 2013
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic
...
-
, et. al. ...
26 May 2019
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
Edouard Bonnet ... John Sylvester
-
Edouard Bonnet, et. al.Edouard Bonnet ... John Sylvester
01 Jan 2024
View more papers

More From: SIAM Journal on Computing

Paper Title
Journal
Date
Author
Almost-Ramanujan Expanders From Arbitrary Expanders via Operator Amplification
Fernando Granha Jeronimo ... Avi Wigderson
SIAM Journal on Computing | VOL. -
Fernando Granha Jeronimo, et. al.Fernando Granha Jeronimo ... Avi Wigderson
27 Jan 2025
Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier
Jane Lange ... Arsen Vasilyan
SIAM Journal on Computing | VOL. -
Jane Lange, et. al.Jane Lange ... Arsen Vasilyan
23 Jan 2025
Algebraic Algorithms for Fractional Linear Matroid Parity via Noncommutative Rank
Taihei Oki ... Tasuku Soma
SIAM Journal on Computing | VOL. 54
Taihei Oki, et. al.Taihei Oki ... Tasuku Soma
16 Jan 2025
Fitting Metrics and Ultrametrics with Minimum Disagreements
Vincent Cohen-Addad ... Arnaud De Mesmay
SIAM Journal on Computing | VOL. 54
Vincent Cohen-Addad, et. al.Vincent Cohen-Addad ... Arnaud De Mesmay
15 Jan 2025
View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.