4940 search results - page 148 / 988 » On the Complexity of Universal Programs |
156
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
144
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
147
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
131
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
125
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...