1007 search results - page 7 / 202 » The Complexity of Futile Questioning |
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
ACL
2010
13 years 5 months ago
2010
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
CCCG
2009
13 years 5 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
GC
2011
Springer
12 years 11 months ago
2011
Springer
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
AUTOMATICA
1999
13 years 7 months ago
1999
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...