1132 search results - page 59 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
DLT
2007
15 years 1 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
JCT
2011
14 years 6 months ago
2011
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
LATA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
111
click to vote
PODS
1992
ACM
15 years 3 months ago
1992
ACM
: We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equiv...