855 search results - page 29 / 171 » Complexity of Equations over Sets of Natural Numbers |
113
click to vote
PODS
2010
ACM
15 years 2 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
54
Voted
JC
2002
14 years 9 months ago
2002
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
88
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
102
click to vote
JCT
2010
14 years 4 months ago
2010
There exist several theorems which state that when a matroid is representable over distinct fields 1,..., k, it is also representable over other fields. We prove a theorem, the Li...
FSEN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...