1888 search results - page 201 / 378 » Proof theory and computational analysis |
109
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
127
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
226
click to vote
Book
C code implementation of several math algorithms such as Linear Algebraic Equations,
Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...
226
Voted
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
75
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper addresses the relationship between the Visual Assessment of cluster Tendency (VAT) algorithm and Dunn’s cluster validity index. We present an analytical comparison in...