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

Clicks: 250
ID: 132988
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #13 of 102 articles by views in ama journal of ethics

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
To study groups with small Dehn's function, Olshanskii and Sapir developed a new invariant of bipartite chords diagrams and applied it to hub-free realization of S-machines. In this paper we consider this new invariant together with groups constructed from S-machines containing the hub relation. The idea is to study the links between the topology of the asymptotic cones and polynomial time computations. Indeed it is known that the topology of such metric space depends on diagrams without hubs that do not correspond to the computations of the considered S-machine. This work gives sufficient conditions that avoid this misbehaviour, but as we shall see the method has a significant drawback.
Reference Key
gasperin2013electronictopology Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Anthony Gasperin
Journal ama journal of ethics
Year 2013
DOI
10.4204/EPTCS.128.15
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.