2303 search results - page 352 / 461 » On the logic of argumentation theory |
189
Voted
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
163
Voted
MLG
2007
Springer
16 years 1 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
192
click to vote
APLAS
2005
ACM
16 years 17 days ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
220
click to vote
ASIACRYPT
2005
Springer
16 years 17 days ago
2005
Springer
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
197
click to vote
SIGECOM
2003
ACM
16 years 8 days ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...