3946 search results - page 54 / 790 » The computational complexity of choice sets |
121
Voted
COLING
1992
15 years 5 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
122
click to vote
IPL
2007
15 years 4 months ago
2007
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXPcomplete sets [3] ...
141
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
135
click to vote
HOTOS
2009
IEEE
15 years 8 months ago
2009
IEEE
Distributed systems are difficult to design and develop. The difficulties arise both in basic safety correctness properties, and in achieving high performance. As a result of this...
131
click to vote
ENTCS
2008
15 years 4 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...