scientific article
From MaRDI portal
Publication:3815528
zbMath0664.68052MaRDI QIDQ3815528
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (5)
On the lattices of NP-subspaces of a polynomial time vector space over a finite field ⋮ Complexity and categoricity ⋮ Feasibly categorical models ⋮ Polynomial-time axioms of choice and polynomial-time cardinality ⋮ Feasible graphs with standard universe
This page was built for publication:
