A conjecture about polynomial time computable lattice-lattice functions
From MaRDI portal
Publication:3580992
DOI10.1145/1007352.1007426zbMath1192.68335OpenAlexW2008751581MaRDI QIDQ3580992
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007426
Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30) Axiom of choice and related propositions (03E25)
This page was built for publication: A conjecture about polynomial time computable lattice-lattice functions
