2412 search results - page 1 / 483 » Which Problems Have Strongly Exponential Complexity |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
ECCC
2011
13 years 10 days ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
JOC
2010
13 years 4 days ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
EEMMAS
2007
Springer
13 years 11 months ago
2007
Springer
Complexity of near future and even nowadays applications is exponentially increasing. In order to tackle the design of such complex systems, being able to engineer self-organising ...
EAAI
2008
13 years 5 months ago
2008
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...