scientific article; zbMATH DE number 3499765
From MaRDI portal
Publication:4081256
Cited in
(7)- An information-theoretic method in combinatorial theory
- Kolmogorov complexity arguments in combinatorics
- On the metric dimension of Cartesian powers of a graph
- Exact learning from an honest teacher that answers membership queries
- Philosophical issues in Kolmogorov complexity
- Optimal schemes for combinatorial query problems with integer feedback
- Toward a deterministic polynomial time algorithm with optimal additive query complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4081256)
