2008 IEEE International Conference on Industrial Technology 2008
DOI: 10.1109/icit.2008.4608682
|View full text |Cite
|
Sign up to set email alerts
|

An application of complexity measures in addressing modes for CISC- and RISC-architectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…Big O notation used for measuring code performance in terms of growth function of an algorithm's frequency count of its basic operation [12][13] [14]. The proposed method for computation can be extended to also express time complexities in terms of big O notation.…”
Section: Analyzing Time Complexitiesmentioning
confidence: 99%
“…Big O notation used for measuring code performance in terms of growth function of an algorithm's frequency count of its basic operation [12][13] [14]. The proposed method for computation can be extended to also express time complexities in terms of big O notation.…”
Section: Analyzing Time Complexitiesmentioning
confidence: 99%