Topology of Asymptotic Cones and Non-deterministic Polynomial Time Computations
From MaRDI portal
Publication:5326369
DOI10.1007/978-3-642-39053-1_22zbMath1390.68317arXiv1401.5290OpenAlexW89716402MaRDI QIDQ5326369
Publication date: 5 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.5290
Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: Topology of Asymptotic Cones and Non-deterministic Polynomial Time Computations
