Disjunctions of negated counting functions are efficiently learnable with equivalence queries

DOI10.1007/bfb0030849zbMath1527.68101MaRDI QIDQ6085721

Zhixiang Chen

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational learning theory (68Q32) Combinatorics in computer science (68R05) Primes (11A41)

Cites Work

• Efficient learning with equivalence queries of conjunctions of modulo functions
• Queries and concept learning
• Learning Integer Lattices

This page was built for publication: Disjunctions of negated counting functions are efficiently learnable with equivalence queries