Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Thapen, Neil Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 1 of 1 reviews    
  The ordering principle in a fragment of approximate counting
Atserias A., Thapen N. ACM Transactions on Computational Logic 15(4): 1-11, 2014.  Type: Article

This paper solves an open problem in the field of bounded arithmetic. Bounded arithmetic is an area developed for the logical analysis of the expressive properties of the polynomial hierarchy in theoretical computer science [1]. Fragme...
...
Jan 27 2015  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy