Sciweavers

855 search results - page 41 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
ICDT
2009
ACM
135views Database» more  ICDT 2009»
15 years 4 months ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
ECCC
2008
168views more  ECCC 2008»
14 years 9 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 9 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
IWPC
2010
IEEE
14 years 8 months ago
Identification of Idiom Usage in C++ Generic Libraries
—A tool supporting the automatic identification of programming idioms specific to the construction of C++ generic libraries is presented. The goal is to assist developers in unde...
Andrew Sutton, Ryan Holeman, Jonathan I. Maletic