71 search results - page 11 / 15 » jcss 2006 |
JCSS
2010
13 years 8 months ago
2010
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in...
JCSS
2006
13 years 9 months ago
2006
We introduce the probabilistic class SBP which is defined in a BPP-like manner. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probabil...
JCSS
2000
13 years 9 months ago
2000
We investigate a class of path constraints that is of interest in connection with both semistructured and structured data. In standard database systems, constraints are typically ...
JCSS
2000
13 years 9 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
JCSS
2002
13 years 9 months ago
2002
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...