Strengthening of the theorems on polynomial queries
From MaRDI portal
Publication:1272059
zbMath0925.68137MaRDI QIDQ1272059
Publication date: 23 November 1998
Published in: Programming and Computer Software (Search for Journal in Brave)
Related Items (2)
\(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ Linear ordering on graphs, anti-founded sets and polynomial time computability
This page was built for publication: Strengthening of the theorems on polynomial queries