Deepak Kumar
- Hayes, Brian, The Semicolon Wars, American Scientist, Volume 94, July-August 2006.Google Scholar
- Norvig, Peter, Teach Yourself Programming in Ten years, http://norvig.com/21-days.html (2001).Google Scholar
- Ousterhout, John K., Scripting: Higher level programming for the 21st Century, IEEE Computer, March 1998. Google ScholarDigital Library
- TIOBE Programming Community Index for June 2010, www.tiobe.comGoogle Scholar
Index Terms
- REFLECTIONS
Language wars and false dichotomies
Recommendations
Non-dichotomies in Constraint Satisfaction Complexity
ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part IIWe show that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem L an ï -categorical template Γ such that L reduces to ...
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP
Jaeger et al. (Math Proc Camb Philos Soc 108(1):35---53, 1990) proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: the evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time ...
Dichotomies in the Complexity of Preferred Repairs
PODS '15: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsThe framework of database repairs provides a principled approach to managing inconsistencies in databases. Informally, a repair of an inconsistence database is a consistent database that differs from the inconsistent one in a "minimal way." A ...
Comments