Time-space tradeoffs for counting NP solutions modulo integers
From MaRDI portal
(Redirected from Time-space tradeoffs for counting NP solutions modulo integers)
Recommendations
Cited in
(7)- Unifying known lower bounds via geometric complexity theory
- Time-space efficient simulations of quantum computations
- Limits on alternation trading proofs for time-space lower bounds
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle
- An Improved Time-Space Lower Bound for Tautologies
- Improved streaming algorithm for the Klee's measure problem and generalizations
- Super-critical trade-offs in resolution over parities via lifting
This page was built for publication: Time-space tradeoffs for counting NP solutions modulo integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q937201)