Representing polynomial of \textsc{St-Connectivity}

DOI10.46298/DMTCS.9934MaRDI QIDQ6599807

Jānis Iraids, J. Smotrovs

Publication date: 6 September 2024

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

zbMATH Keywords

connectivityatomistic latticeMonotone Boolean functionrepresenting polynomial

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kostant partitions functions and flow polytopes
• Complexity measures and decision tree complexity: a survey.
• Quivers, cones and polytopes.
• Constant depth circuits, Fourier transform, and learnability
• Quantum lower bounds for the collision and the element distinctness problems
• On the Fourier spectrum of monotone functions
• Convex Polytopes
• Analysis of Boolean Functions
• The polynomial method strikes back: tight quantum query bounds via dual polynomials
• Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
• Quantum lower bounds by polynomials
• Bipartite perfect matching as a real polynomial
• The approximate degree of bipartite perfect matching

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)