scientific article; zbMATH DE number 4087025

MaRDI QIDQ3815528zbMATH OpenFDO

Authors Jeffrey Remmel, Anil Nerode

Publication date 1987

zbMATH Keywords

complexity theoretic algebraoraclepriority methodrelativization

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the lattices of NP-subspaces of a polynomial time vector space over a finite field
• scientific article; zbMATH DE number 176212
• Algebrization: a new barrier in complexity theory
• On speedable and levelable vector spaces
• scientific article; zbMATH DE number 1375589

Cited in

(9)

• The complexity of linear problems in fields
• Feasible graphs with standard universe
• On speedable and levelable vector spaces
• Complexity and categoricity
• On the lattices of NP-subspaces of a polynomial time vector space over a finite field
• scientific article; zbMATH DE number 176212 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• Feasibly categorical models
• Polynomial-time axioms of choice and polynomial-time cardinality

This page was built for publication:

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