A conjecture about polynomial time computable lattice-lattice functions

DOI10.1145/1007352.1007426zbMATH Open1192.68335OpenAlexW2008751581MaRDI QIDQ3580992FDOQ3580992

Miklós Ajtai

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30) Axiom of choice and related propositions (03E25)

Cited In (3)

• The \(\ell_p\)-function on finite Boolean lattices
• Laced Boolean functions and subset sum problems in finite fields
• Lattice equations and their solutions with complexity of polynomial class

   Recommendations

• On the Computational Complexity of Algebra on Lattices 👍 👎
• Title not available (Why is that?) 👍 👎
• On computable presentations of some functional lattices 👍 👎
• The complexity of functions on lattices 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A conjecture about polynomial time computable lattice-lattice functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580992)