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,176–2,200 of 3,152 articles for Computational complexity

Then save them, add them to a collection or cite them together.
  1. Research article · 28 Apr 2015

    An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications

    Genetics and Molecular Research · Volume 14, Issue 2

    entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study…

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