question
active
question:can-we-characterize-polynomial-time-computation-and-other-complexity-classes-in-such-terms

Can we characterize polynomial-time computation and other complexity classes in such terms?

Hoping for machine-independent, geometrical characterizations of complexity classes via interaction models.

Source paper

extracted_from
Information, Processes and Games
Abramsky, Samson

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.