5510 search results - page 192 / 1102 » Mathematics |
116
click to vote
ENDM
2010
15 years 4 months ago
2010
Electronic Notes in Discrete Mathematics 36 (2010) 1065
127
Voted
ENTCS
2006
15 years 4 months ago
2006
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
116
click to vote
IJBC
2006
15 years 4 months ago
2006
We discuss mathematical and physical arguments against continuity and in favor of discreteness, with particular emphasis on the ideas of Emile Borel (1871
133
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
127
click to vote
JIIS
2008
15 years 4 months ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...