Circuits in bounded arithmetic. I
type: Item
instance of: scholarly article
title: Circuits in bounded arithmetic. I
zbMATH Open document ID: 0865.03046
DOI: 10.1007/BF01531025
author: Spyro-Giorgio Mantzivis
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-05-13T00:00:00Z
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1005823
zbMATH Keywords: bounded arithmetic
zbMATH Keywords: polynomial size circuit families
zbMATH Keywords: polynomial time computable
MaRDI profile type: Publication
cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Expressibility and Parallel Complexity
full work available at URL: https://doi.org/10.1007/bf01531025
OpenAlex ID: W1964621816
Recommended article: Circuit lower bounds in bounded arithmetics
Recommended article: A Selection of Lower Bounds for Arithmetic Circuits
Recommended article: Q4938621
Recommended article: Arithmetic Circuits: A survey of recent results and open questions
Recommended article: On defining integers and proving arithmetic circuit lower bounds
Recommended article: Bounded algebra and current-mode digital circuits
Recommended article: Q4893147
Recommended article: Q4266170
Recommended article: Lower bounds on arithmetic circuits via partial derivatives
Recommended article: Arithmetic and Algebraic Circuits
description: scientific article; zbMATH DE number 1005823