1772 search results - page 186 / 355 » Classifying Problems into Complexity Classes |
89
Voted
JCT
2011
14 years 7 months ago
2011
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three clas...
83
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
118
click to vote
EUROCRYPT
2007
Springer
15 years 7 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
104
Voted
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
129
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...