"On why an algorithmic time complexity measure can be system invariant ..."

Soubhik Chakraborty, Suman Kumar Sourabh (2007)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2007.01.016

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/ChakrabortyS07c
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/ChakrabortyS07c
Soubhik Chakraborty, Suman Kumar Sourabh:
On why an algorithmic time complexity measure can be system invariant rather than system independent. Appl. Math. Comput. 190(1): 195-204 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.