AI Chat AI Image Generator AI Video Text to Speech

A Logical Characterization of Constant-Depth Circuits over the Reals

05/11/2020

∙

by Timon Barlag, et al.

∙

∙

In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size and constant depth decide exactly those sets of vectors of reals that can be defined in first-order logic on R-structures in the sense of Cucker and Meer. Our characterization holds both non-uniformily as well as for many natural uniformity conditions.

Timon Barlag
3 publications
Heribert Vollmer
8 publications

page 1

page 2

page 3

page 4

research

∙ 02/27/2023

Logical Characterization of Algebraic Circuit Classes over Integral Domains

We present an adapted construction of algebraic circuits over the reals ...

0 Timon Barlag, et al. ∙

research

∙ 05/15/2022

Simple Hard Instances for Low-Depth Algebraic Proofs

We prove super-polynomial lower bounds on the size of propositional proo...

0 Nashlen Govindasamy, et al. ∙

research

∙ 02/19/2018

Ensemble computation approach to the Hough transform

It is demonstrated that the classical Hough transform with shift-elevati...

0 Timur M. Khanipov, et al. ∙

research

∙ 02/27/2019

Learning Logistic Circuits

This paper proposes a new classification model called logistic circuits....

8 Yitao Liang, et al. ∙

research

∙ 05/04/2021

Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits

We give new and efficient black-box reconstruction algorithms for some c...

0 Vishwas Bhargava, et al. ∙

research

∙ 10/05/2017

Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth

In this paper we give a characterization of both Boolean and arithmetic ...

0 Arnaud Durand, et al. ∙

research

∙ 10/10/2018

The Fundamental Theorem of Algebra in ACL2

We report on a verification of the Fundamental Theorem of Algebra in ACL...

0 Ruben Gamboa, et al. ∙