Representing polynomial of \textsc{St-Connectivity}

DOI10.46298/DMTCS.9934MaRDI QIDQ6599807zbMATH OpenFDO

Authors Jānis Iraids, J. Smotrovs

Publication date 6 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license arXiv.org Non-exclusive license to distribute

Full work available at URL https://doi.org/10.46298/DMTCS.9934

zbMATH Keywords

atomistic latticeconnectivityMonotone Boolean functionrepresenting polynomial

Mathematics Subject Classification ID

Computer science (68-XX) Boolean functions (94D10)

Cites work

• Analysis of Boolean Functions
• Complexity measures and decision tree complexity: a survey.
• Constant depth circuits, Fourier transform, and learnability
• Convex Polytopes
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Kostant partitions functions and flow polytopes
• On the Fourier spectrum of monotone functions
• Quantum lower bounds by polynomials
• Quantum lower bounds for the collision and the element distinctness problems
• Quantum speedups for exponential-time dynamic programming algorithms
• Quivers, cones and polytopes.
• The approximate degree of bipartite perfect matching
• The polynomial method strikes back: tight quantum query bounds via dual polynomials

Cited in

(1)

• Semi-invariants of filtered quiver representations with at most two pathways

This page was built for publication: Representing polynomial of \textsc{St-Connectivity}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599807)