Topology and non-deterministic polynomial time computation: avoidance of the misbehaviour of hub-free diagrams and consequences

MaRDI QIDQ4992871zbMATH OpenFDO

Authors Anthony Gasperin

Publication date 10 June 2021

Full work available at URL https://arxiv.org/abs/1309.1269, http://eptcs.web.cse.unsw.edu.au/paper.cgi?MCU2013.15

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Classical models of computation (Turing machines, etc.) (68Q04) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Topology of asymptotic cones and non-deterministic polynomial time computations
• Groups with small Dehn functions and bipartite chord diagrams.
• Isoperimetric and isodiametric functions of groups
• scientific article; zbMATH DE number 569736
• Space functions of groups.

Cited in

(1)

• Topology of asymptotic cones and non-deterministic polynomial time computations

This page was built for publication: Topology and non-deterministic polynomial time computation: avoidance of the misbehaviour of hub-free diagrams and consequences

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