Scholars Central

Search Scholars Central

Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.

Advanced searchHide advanced search

In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:

Years

2,626–2,650 of 3,152 articles for Computational complexity

Then save them, add them to a collection or cite them together.
  1. Research article · Jan 2014

    Computing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NPHard in polynomial time

    International Journal of Innovative Research in Computer and Communication Engineering · Volume 2, Issue 1

    problem in polynomial time with the help of approximation algorithm. Second case, otherwise the computational complexity of the problem remains non-polynomial. Normally, the network operator needs to find ... ordered…

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels