z-logo
open-access-imgOpen Access
Fast routing verification with complexity effect for SOC
Author(s) -
YangHsin Fan
Publication year - 2018
Publication title -
applied computing and informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 22
eISSN - 2634-1964
pISSN - 2210-8327
DOI - 10.1016/j.aci.2018.01.002
Subject(s) - computer science , routing (electronic design automation) , set (abstract data type) , system on a chip , circuit complexity , computational complexity theory , computer engineering , integrated circuit , electronic circuit , computer architecture , channel (broadcasting) , digital electronics , embedded system , algorithm , computer network , electrical engineering , programming language , engineering , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom