Query complexity of matroids
10.1007/978-3-642-38233-8_25
Saved in:
Main Authors: | Kulkarni, R., Santha, M. |
---|---|
Other Authors: | CENTRE FOR QUANTUM TECHNOLOGIES |
Format: | Conference or Workshop Item |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/117268 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A composition theorem for randomized query complexity
by: Anshu, Anurag, et al.
Published: (2018) -
Optimal direct sum results for deterministic and randomized decision tree complexity
by: Jain, R., et al.
Published: (2013) -
EXPLORING DIFFERENT MODELS OF QUERY COMPLEXITY AND COMMUNICATION COMPLEXITY
by: SUPARTHA PODDER
Published: (2016) -
Modeling and recognition of signs in Signing Exact English (SEE)
by: KONG WEI WEON
Published: (2019) -
Attendant word complexes in Khmer (Cambodian)
by: Ayako, Sakamoto
Published: (2024)