Tradeoff lower lounds for stack machines
From MaRDI portal
Publication:744614
DOI10.1007/S00037-012-0057-1zbMATH Open1366.68055OpenAlexW2146634436MaRDI QIDQ744614FDOQ744614
Authors: Matei David, Periklis A. Papakonstantinou 
Publication date: 25 September 2014
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-012-0057-1
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- The space complexity of approximating the frequency moments
- Computational Complexity
- On uniform circuit complexity
- Communication Complexity
- Title not available (Why is that?)
- Reversal Complexity
- Reversal complexity revisited
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness
- P-uniform circuit complexity
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Properties that characterize LOGCFL
- Tally languages and complexity classes
- Title not available (Why is that?)
- Tree-size bounded alternation
- Two Applications of Inductive Counting for Complementation Problems
- Lower bounds for randomized read/write stream algorithms
This page was built for publication: Tradeoff lower lounds for stack machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744614)
