scientific article; zbMATH DE number 7347823

DOI10.4086/cjtcs.2020.001zbMath1503.68076arXiv1901.05911OpenAlexW4235367445MaRDI QIDQ4988300

Arkadev Chattopadhyay, Meena Mahajan, Nitin Saurabh, Nikhil S. Mande

Publication date: 14 May 2021

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.05911

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

zbMATH Keywords

decision listslinear threshold functionsthreshold circuits

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (2)

Linear threshold functions in decision lists, decision trees, and depth-2 circuits ⋮ Proof complexity of symbolic QBF reasoning

Cites Work

• On the computational power of Boolean decision lists
• Some intersection theorems for ordered sets and graphs
• Harmonic Analysis of Polynomial Threshold Functions
• Optimal numberings and isoperimetric problems on graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: