On Abstraction and Equivalence in Software Patent Doctrine: A Response to Bessen, Meurer and Klemens

Citation data:

Journal of Intellectual Property Law, Vol: 16, Issue: 2, Page: 197

Publication Year:
2016
Usage 88
Downloads 81
Abstract Views 7
Social Media 1
Tweets 1
Repository URL:
https://digitalcommons.law.uga.edu/jipl/vol16/iss2/1
Author(s):
Chin, Andrew
Tags:
Bessen; Meurer; Klemens; In re Bilski; Patent Act; End Software Patents Project; Church-Turing thesis; polynomial-time algorithms; NP-completeness; polynomial-time reductions; linear programming; mathematical programming; nonlinear programming problem; methods and apparatus for efficient resource allocation; Applied Mathematics; Intellectual Property Law
Most Recent Tweet View All Tweets
article description
By Andrew Chin, Published on 09/08/16