787 search results - page 15 / 158 » Polynomial Constants are Decidable |
ASIACRYPT
2011
Springer
12 years 8 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
FOCS
1999
IEEE
14 years 8 days ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...