1368 search results - page 176 / 274 » Generalized Rook Polynomials |
138
click to vote
ASIACRYPT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
138
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
170
click to vote
TACAS
2007
Springer
15 years 11 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
128
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
In many negotiation and bargaining scenarios, a particular agent may need to interact repeatedly with another agent. Typically, these interactions take place under incomplete info...
155
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...