Query Complexity of Matroids

DOI10.1007/978-3-642-38233-8_25zbMath1382.68094OpenAlexW2179181384MaRDI QIDQ4924658

Miklos Santha, Raghav Kulkarni

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_25

zbMATH Keywords

matroidsFourier spectrumread-once formulae(parity, randomized, quantum) decision tree complexity

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (1)

Alternation, sparsity and sensitivity: bounds and exponential gaps

This page was built for publication: Query Complexity of Matroids