39 search results - page 2 / 8 » Nondeterministic Instance Complexity and Proof Systems with ... |
FUIN
2000
13 years 6 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
CIE
2008
Springer
13 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
CIE
2008
Springer
13 years 8 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
CC
2007
Springer
13 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
ENTCS
2006
13 years 6 months ago
2006
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...