Strengths and Weaknesses of LH Arithmetic

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200202)48:2<221::AID-MALQ221>3.0.CO;2-V" /><221::AID-MALQ221>3.0.CO;2-V 10.1002/1521-3870(200202)48:2<221::AID-MALQ221>3.0.CO;2-VzbMath1002.03051OpenAlexW2079838771MaRDI QIDQ4531087

Randall Pruim, Chris Pollett

Publication date: 24 July 2002

Full work available at URL: https://doi.org/10.1002/1521-3870(200202)48:2<221::aid-malq221>3.0.co;2-v

zbMATH Keywords

independencebounded arithmeticfeasible lower bounds

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

A theory for Log-Space and NLIN versus co-NLIN

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Strengths and Weaknesses of LH Arithmetic