query-complexity
Here are 8 public repositories matching this topic...
A toolkit for teaching, learning, and doing research in Boolean function analysis. Fourier analysis, property testing, query complexity, hypercontractivity, pseudorandomness, and more
- Updated Aug 17, 2026
- Jupyter Notebook
Framework for empirically exploring query complexity questions
- Updated Apr 28, 2020
- OCaml
The project applied database principles to a real-world mental health problem, emphasizing reliable data management, and showcased practical solutions to mental health challenges.
- Updated May 11, 2023
- Java
Exact computational verification for memory under unknown future access
- Updated Aug 22, 2026
- TeX
Determine in one query whether a 3-bit Boolean function is constant or balanced (oracle: f = x₀ ⊕ x₁ ⊕ x₂).
- Updated Mar 23, 2026
- OpenQASM
GraphQL operation guard for a supplied AST: fragment-aware depth limit with cycle guard, per-field complexity scoring, operation allowlist/denylist, and introspection blocking. graphql-js is optional — accepts its document shape structurally, zero hard dependencies.
- Updated Aug 13, 2026
- TypeScript
Pure Relative Structured Matrix Approximation with Square-Root Matvecs DOI: https://doi.org/10.5281/zenodo.21698599
- Updated Aug 23, 2026
- TeX
Analyze and limit the cost of GraphQL queries using configurable field costs
- Updated Aug 24, 2026
- JavaScript
Improve this page
Add a description, image, and links to the query-complexity topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the query-complexity topic, visit your repo's landing page and select "manage topics."