Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 3499765

From MaRDI portal
Publication:4081256
Jump to:navigation, search

zbMath0319.05001MaRDI QIDQ4081256

No author found.

Publication date: 1970


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Enumerative combinatorics (05Axx)


Related Items (7)

Kolmogorov complexity arguments in combinatorics ⋮ Exact learning from an honest teacher that answers membership queries ⋮ On the metric dimension of Cartesian powers of a graph ⋮ Optimal schemes for combinatorial query problems with integer feedback ⋮ An information-theoretic method in combinatorial theory ⋮ Philosophical issues in Kolmogorov complexity ⋮ Toward a deterministic polynomial time algorithm with optimal additive query complexity







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4081256&oldid=17831986"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 05:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki