14161 search results - page 301 / 2833 » On generalized middle-level problem |
177
click to vote
MFCS
2004
Springer
15 years 12 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
153
click to vote
EVOW
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
196
click to vote
IMR
2003
Springer
15 years 11 months ago
2003
Springer
The quality of numerical simulations of processes that are modeled by partial differential equations strongly depends on the quality of the mesh that is used for their discretiza...
185
click to vote
ISMVL
2000
IEEE
15 years 11 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...
170
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...