4940 search results - page 582 / 988 » On the Complexity of Universal Programs |
142
click to vote
JAR
1998
15 years 6 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
157
click to vote
SIGCSE
2002
ACM
15 years 6 months ago
2002
ACM
We adopt the view that CS1 labs are not programming assignments, and that they should not be used for grading students or assessing their level of understanding. Instead, we think...
158
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
214
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
167
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
Modern development environments often involve models with complex consistency relations. Some of the relations can be automatically established through "fixing procedures&quo...