On the complexity of computation of rudimentary predicates
From MaRDI portal
Publication:4809504
DOI10.1515/DMA.2000.10.6.571zbMATH Open1044.03026OpenAlexW2009068921MaRDI QIDQ4809504
Author name not available (Why is that?)
Publication date: 30 August 2004
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.2000.10.6.571
No records found.
No records found.
This page was built for publication: On the complexity of computation of rudimentary predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809504)