7106 search results - page 372 / 1422 » Restricted Complexity, General Complexity |
180
Voted
FSTTCS
2009
Springer
16 years 21 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
152
Voted
LPNMR
2007
Springer
16 years 8 days ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
185
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
141
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
190
Voted
CRYPTO
2007
Springer
16 years 9 days ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...