67
Voted
CIE
2006
Springer
15 years 21 days ago
2006
Springer
86
Voted
CIE
2006
Springer
15 years 2 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
83
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called super...
64
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
67
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
124
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
76
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragments of a calculus based on finite types and G
105
click to vote
CIE
2006
Springer
15 years 4 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
68
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
104
click to vote
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...