11862 search results - page 413 / 2373 » Relative information completeness |
339
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
166
Voted
CADE
2006
Springer
16 years 7 months ago
2006
Springer
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
177
Voted
FOSSACS
2001
Springer
15 years 12 months ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
175
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style exte...
214
Voted
ECCC
2008
15 years 7 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...