The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-16486-3_91
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Semantic Hierarchy for Intuitionistic Logic

Indagationes Mathematicae
Mathematics
2019English

Graph Ramsey Theory and the Polynomial Hierarchy

1999English

On the Intuitionistic Fuzzy Polynomial Ideals of a Ring

Notes on Intuitionistic Fuzzy Sets
2018English

Elimination of Parameters in the Polynomial Hierarchy

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1999English

Polynomial Arithmetic Using Sequential Stochastic Logic

2016English

Practical Divide-And-Conquer Algorithms for Polynomial Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Polynomial Dynamic and Lattice Orbits in S-Arithmetic Homogeneous Spaces

Confluentes Mathematici
MathematicsApplied MathematicsMathematical Physics
2010English

Arithmetic Properties of Polynomial Specializations Over Finite Fields

Acta Arithmetica
Number TheoryAlgebra
2009English

Bounded Color Multiplicity Graph Isomorphism Is in the #L Hierarchy

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy