9842 search results - page 145 / 1969 » The Complexity of the Matching-Cut Problem |
177
click to vote
AML
2011
14 years 10 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
140
Voted
EUROCRYPT
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
136
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
110
Voted
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Accurate and systematic channel simulation technique is critical for performance verification of digital transceiver design over wireless channels. Despite the abundant results on ...
135
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...