787 search results - page 93 / 158 » Polynomial Constants are Decidable |
143
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
157
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
161
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
140
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
151
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...