5608 search results - page 219 / 1122 » On the Theory of Matchgate Computations |
170
click to vote
TCS
2010
15 years 1 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
220
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
287
click to vote
Publication
Foundations of Mechanism Design: A Tutorial - Part 1: Key Concepts and Classical Results
200
click to vote
Lecture Notes
in Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani (eds.), Chapter 16, Cambrige University Press, 2007
