Titlebook: Mathematical Foundations of Computer Science 2012; 37th International S Branislav Rovan,Vladimiro Sassone,Peter Widmayer Conference proceed

geometrician

包租车船

New Races in Parameterized Algorithmics, further aspects of efficiency that deserve attention. We discuss several of these aspects and particularly focus on the search for “stronger parameterizations” in developing fixed-parameter algorithms.

抑制

synovitis

Simple Models for Recursive Schemes,ough of as a syntactic simplification of a fragment of the lambda calculus, we propose to go back to lambda calculus to study schemes. In particular, for the model checking problem we propose to use standard finitary models for the simply-typed lambda calculus.

gout109

Computation of Least Fixed Points,f fixed points for general (nonlinear) algebraic functions, with the 3-player Nash equilibrium problem as a prototypical example, and PPAD for the computation of fixed points for piecewise linear functions, with the 2-player Nash equilibrium problem as a prototypical example.

串通

Reductions to the Set of Random Strings: The Resource-Bounded Case,of time-.-bounded Kolmogorov-random strings (for all large enough time bounds .), then . is in P/poly, and that if in addition such a reduction exists for any universal Turing machine one uses in the definition of Kolmogorov complexity, then . is in PSPACE.

里程碑

Cursory

Conference proceedings 2012es, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

按时间顺序

anthesis