468 search results - page 81 / 94 » One-Way Functions in Complexity Theory |
SODA
2004
ACM
15 years 10 days ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
EOR
2006
14 years 11 months ago
2006
CT In this paper some experimental sequential models for the simulation of trip-chains are presented; the models have been calibrated on the base of a survey made in a medium-sized...
131
click to vote
DIMACS
1996
15 years 8 days ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
117
click to vote
CIKM
2010
Springer
14 years 9 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
FOCS
2008
IEEE
15 years 5 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...