Logical characterizations of algebraic circuit classes over integral domains

DOI10.1017/S0960129524000136MaRDI QIDQ6620024

Florian Chudigiewitsch, Timon Barlag, Sabrina Alexandra Gaube

Publication date: 16 October 2024

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

descriptive complexityalgebraic circuits

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Finite model theory and its applications.
• Elements of finite model theory.
• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
• Metafinite model theory
• A logical characterization of constant-depth circuits over the reals
• Logics which capture complexity classes over the reals
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Logical characterizations of algebraic circuit classes over integral domains

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