217 search results - page 13 / 44 » Circuit Complexity of Regular Languages |
143
click to vote
NJC
2006
15 years 1 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
130
click to vote
PAAMS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
123
click to vote
ISMVL
2000
IEEE
15 years 6 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
111
click to vote
SODA
2001
ACM
15 years 2 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
100
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...