Combinatorial Expressions and Lower Bounds.
From MaRDI portal
Publication:2955000
DOI10.4230/LIPIcs.STACS.2015.249zbMath1355.68085OpenAlexW2246005056MaRDI QIDQ2955000
Amaldev Manuel, Thomas Colcombet
Publication date: 24 January 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/4918/pdf/18.pdf
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Combinatorial Expressions and Lower Bounds.