Tight Lower Bound on Equivalence Testing in Conditional Sampling Model.
ACM-SIAM Symposium on Discrete Algorithms
Saved in:
Main Authors: | Chakraborty, Diptarka, Chakraborty, Sourav, Kumar, Gunjan |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
SIAM
2024
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/248711 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Tight Lower Bound on Equivalence Testing in Conditional Sampling Model.
by: Chakraborty, Diptarka, et al.
Published: (2024) -
Equivalence Testing: The Power of Bounded Adaptivity.
by: Chakraborty, Diptarka, et al.
Published: (2024) -
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?
by: Chakraborty, Diptarka, et al.
Published: (2023) -
New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures.
by: Chakraborty, Diptarka, et al.
Published: (2020) -
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
by: Moran, S., et al.
Published: (2013)