Prati
Albert Atserias
Naslov
Citirano
Citirano
Godina
Size bounds and query plans for relational joins
A Atserias, M Grohe, D Marx
SIAM Journal on Computing 42 (4), 1737-1767, 2013
3562013
A combinatorial characterization of resolution width
A Atserias, V Dalmau
Journal of Computer and System Sciences 74 (3), 323-334, 2008
1792008
Clause-learning algorithms with many restarts and bounded-width resolution
A Atserias, JK Fichte, M Thurley
Journal of Artificial Intelligence Research 40, 353-373, 2011
1502011
Affine systems of equations and counting infinitary logic
A Atserias, A Bulatov, A Dawar
Theoretical Computer Science 410 (18), 1666-1683, 2009
1252009
Sherali--Adams relaxations and indistinguishability in counting logics
A Atserias, E Maneva
SIAM Journal on Computing 42 (1), 112-137, 2013
1232013
On digraph coloring problems and treewidth duality
A Atserias
European Journal of Combinatorics 29 (4), 796-820, 2008
1192008
Quantum and non-signalling graph isomorphisms
A Atserias, L Mančinska, DE Roberson, R Šámal, S Severini, ...
Journal of Combinatorial Theory, Series B 136, 289-328, 2019
1072019
On preservation under homomorphisms and unions of conjunctive queries
A Atserias, A Dawar, PG Kolaitis
Journal of the ACM (JACM) 53 (2), 208-237, 2006
912006
Constraint propagation as a proof system
A Atserias, PG Kolaitis, MY Vardi
International Conference on Principles and Practice of Constraint …, 2004
882004
On the automatizability of resolution and related propositional proof systems
A Atserias, ML Bonet
Information and Computation 189 (2), 182-201, 2004
872004
On the Power of k-Consistency
A Atserias, A Bulatov, V Dalmau
International Colloquium on Automata, Languages, and Programming, 279-290, 2007
712007
Narrow proofs may be maximally long
A Atserias, M Lauria, J Nordström
ACM Transactions on Computational Logic (TOCL) 17 (3), 1-30, 2016
622016
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution
A Atserias, ML Bonet, JL Esteban
Information and Computation 176 (2), 136-152, 2002
59*2002
Automating resolution is NP-hard
A Atserias, M Müller
Journal of the ACM (JACM) 67 (5), 1-17, 2020
512020
Preservation under extensions on well-behaved finite structures
A Atserias, A Dawar, M Grohe
SIAM Journal on Computing 38 (4), 1364-1381, 2008
502008
On sufficient conditions for unsatisfiability of random formulas
A Atserias
Journal of the ACM (JACM) 51 (2), 281-311, 2004
43*2004
Bounded-width QBF is PSPACE-complete
A Atserias, S Oliva
Journal of Computer and System Sciences 80 (7), 1415-1429, 2014
412014
Monotone simulations of non-monotone proofs
A Atserias, N Galesi, P Pudlák
Journal of Computer and System Sciences 65 (4), 626-638, 2002
412002
Monotone proofs of the pigeon hole principle
A Atserias, N Galesi, R Gavaldá
Mathematical Logic Quarterly: Mathematical Logic Quarterly 47 (4), 461-474, 2001
342001
Distinguishing SAT from polynomial-size circuits, through black-box queries
A Atserias
21st Annual IEEE Conference on Computational Complexity (CCC'06), 8 pp.-95, 2006
322006
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20