787 search results - page 28 / 158 » Polynomial Constants are Decidable |
LOGCOM
2010
13 years 6 months ago
2010
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...
CSL
2009
Springer
13 years 12 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
STOC
2010
ACM
14 years 3 days ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
CCCG
2007
13 years 9 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...