Titlebook: Computing and Combinatorics; 19th International C Ding-Zhu Du,Guochuan Zhang Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

grotto

Presenting and Defending your Work Orallyoned Automata (DPA). Different from the existing automata, at most three different transitions may occur between two states of a DPA. This leads to a determinization construction of NBA with smaller state complexity but larger transition complexity. Compared with the existing determinization constru

蝕刻

Developing your Project Proposall security (in the seed length), and a large stretch (linear or polynomial in the seed length). We refer to such a pseudorandom generator as an .. We present a simple construction of an asymptotically optimal PRG from any one-way function .:{0,1}.?→?{0,1}. which satisfies the following requirements:

我不死扛

使堅(jiān)硬

Developing your Project Proposalplayers . and .. In this game, . places a point facility inside ., after which . places another point facility inside .. We say that a user . is served by its nearest facility, where distances are measured by the geodesic distance in .. The objective of each player is to maximize the number of users

syncope

Computing and Combinatorics978-3-642-38768-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

ENACT

GRACE

expository

發(fā)展

New Bounds for the Balloon Popping Problemwith anonymous bidders with respect to the best fixed-price scheme. Previous works show that the optimal solution for this problem is in the range [1.6595,2]. We give a new lower bound of 1.68 and design an .(..) algorithm for computing upper bounds as a function of the number of bidders .. Our algo

exigent