JSYML
2010
13 years 7 months ago
2010
In 2007, Terence Tao wrote on his blog an essay about soft analysis, hard analysis and the finitization of soft analysis statements into hard analysis statements. One of his main ...
AMAI
2005
Springer
14 years 19 days ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
APAL
2008
14 years 26 days ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
TAMC
2007
Springer
14 years 6 months ago
2007
Springer
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...