2446 search results - page 108 / 490 » Choiceless Polynomial Time |
99
Voted
SAT
2004
Springer
15 years 6 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
96
Voted
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
104
Voted
LATA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
114
click to vote
COLT
2001
Springer
15 years 5 months ago
2001
Springer
We present results concerning the learning of Monotone DNF (MDNF) from Incomplete Membership Queries and Equivalence Queries. Our main result is a new algorithm that allows effici...
101
Voted
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...