137 search results - page 11 / 28 » Upper Bounds on the Complexity of Some Galois Theory Problem... |
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
COMPGEOM
2009
ACM
14 years 20 days ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
ICALP
2010
Springer
14 years 24 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...