Old Web
English
Sign In
Acemap
>
Paper
>
On the Complexity of Query Answering under Access Limitations: A Computational Formalism.
On the Complexity of Query Answering under Access Limitations: A Computational Formalism.
2018
Andrea Calì
Martín Ugarte
Keywords:
Theoretical computer science
Computer science
Formalism (philosophy)
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]