Author:
Aurora Pawan,Mehta Shashank K.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference46 articles.
1. Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading
2. Ambler AP, Barrow HG, Brown CM, Burstall RH, Popplestone RJ (1973) A versatile computer-controlled assembly system. In: Proceedings of the 3rd international joint conference on artificial intelligence, pp 298–307
3. Arvind V, Torán J (2005) Isomorphism testing: perspective and open problems. Bull EATCS 86:66–84
4. Atserias A, Maneva EN (2012) Sherali–Adams relaxations and indistinguishability in counting logics. In: Innovations in theoretical computer science 2012. Cambridge, MA, pp 367–379
5. Babai L (1981) Moderately exponential bound for graph isomorphism. In: Fundamentals of computation theory, FCT’81, proceedings of the 1981 international FCT-conference, Szeged, Hungary, pp 34–50
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献