The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

  
       
         
    STUDIA MATHEMATICA - Issue no. 1 / 2015  
         
  Article:   BOOK REVIEWS: LANCE FORTNOW, THE GOLDEN TICKET: P, NP, AND THE SEARCH FOR THE IMPOSSIBLE, PRINCETON UNIVERSITY PRESS, 2013, ISBN 978-0-691-15649-1.

Authors:  RADU TRÂMBIŢAŞ. 		 
       
         
  Abstract:  The class P is the class of problems which can be solved in polynomial time on deterministic machines. In Complexity Theory tractable is synonym to having solution algorithm with polynomial runtime. The class NP is the class of problems which can be solved in polynomial time on nondeterministic machines, or equivalently having solutions which can be checked in polynomial time.  
         
     
         
         
      Back to previous page