787 search results - page 25 / 158 » Polynomial Constants are Decidable |
292
click to vote
MST
2011
14 years 9 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
144
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
167
click to vote
APPML
2006
15 years 6 months ago
2006
Let be a polynomial over K (a field of characteristic 0) such that the Hessian of is a nonzero constant. Let
170
click to vote
CC
2005
Springer
15 years 6 months ago
2005
Springer
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
166
click to vote
CONCUR
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checki...