Catalogo dei prodotti della ricerca

LAURIA, MASSIMO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 1.935
EU - Europa 266
AS - Asia 111
SA - Sud America 6
AF - Africa 1
Totale 2.319
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.925
IT - Italia 131
IN - India 71
CN - Cina 40
UA - Ucraina 38
FI - Finlandia 31
SE - Svezia 26
GB - Regno Unito 12
DE - Germania 11
CA - Canada 10
AR - Argentina 6
IE - Irlanda 6
BE - Belgio 3
RO - Romania 3
GR - Grecia 2
NL - Olanda 2
ES - Italia 1
SC - Seychelles 1
Totale 2.319
Salva come PNG Salva come JPEG
Città #
Fairfield 337
Seattle 169
Woodbridge 167
Houston 159
Ashburn 153
Chandler 119
Cambridge 114
Wilmington 104
Ann Arbor 59
Rome 53
San Paolo di Civitate 46
Princeton 43
Plano 38
Boston 30
Dearborn 30
Lawrence 29
Beijing 28
Albano Laziale 17
Millbury 17
Washington 17
Norwalk 16
San Diego 15
Andover 13
Jacksonville 11
Southend 8
Toronto 8
Des Moines 7
Dublin 6
Federal 6
Falls Church 5
Nanjing 4
Brussels 3
Indiana 3
Laurel 3
Milan 3
Boardman 2
Cherry Hill 2
Grafing 2
Hefei 2
Karlsruhe 2
Kunming 2
Ottawa 2
Phoenix 2
Pisa 2
Trumbull 2
Ardea 1
Artena 1
Asciano 1
Ballwin 1
Barcelona 1
Berkeley 1
Buffalo 1
Chengdu 1
Cottbus 1
Eden Prairie 1
Fort Worth 1
Gaeta 1
Groningen 1
Henderson 1
Jinan 1
London 1
New York 1
Portland 1
Redmond 1
Redwood City 1
Rodgau 1
Shenyang 1
University Center 1
Totale 1.883
Salva come PNG Salva come JPEG
Nome #
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies 99
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games 95
Paris-Harrington tautologies 91
Optimality of size-degree tradeoffs for polynomial calculus 85
A characterization of tree-like Resolution size 81
Narrow proofs may be maximally long 80
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. 76
null 76
The complexity of proving that a graph is Ramsey 75
Space complexity in polynomial calculus 72
On the bounded-hop MST problem on random Euclidean instances 72
Parameterized complexity of DPLL search procedures 70
Parameterized Complexity of DPLL Search Procedures 69
Minimum energy broadcast and disk cover in grid wireless networks 68
From small space to small width in resolution 66
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances 66
Cliques enumeration and tree-like resolution proofs 64
Parameterized bounded-depth Frege is not optimal 63
On the Automatizability of Polynomial Calculus 62
Parameterized bounded-depth Frege is not optimal 62
On semantic cutting planes with very small coefficients 61
A rank lower bound for cutting Planes Proofs of Ramsey's Theorem 60
Tight Size-Degree Bounds for Sums-of-Squares Proofs 59
Minimum-Energy Broadcast and disk cover in grid wireless networks 59
Space complexity in polynomial calculus 53
Narrow proofs may be maximally long 53
From small space to small width in resolution 51
The complexity of proving that a graph is Ramsey 51
null 50
null 50
A note about k-DNF resolution 47
null 45
Algorithm analysis through proof complexity 45
null 41
Circular (Yet Sound) Proofs 39
A rank lower bound for cutting planes proofs of Ramsey's theorem 37
Upper bounds on positional Paris–Harrington games 36
Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract) 26
null 17
null 15
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares 9
Clique is hard on average for regular resolution 7
Semantic versus syntactic cutting planes 6
On the maximal part in unrefinable partitions of triangular numbers 6
Circular (Yet Sound) Proofs in Propositional Logic 5
Clique Is Hard on Average for Regular Resolution 5
Verification and generation of unrefinable partitions 5
Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases 5
CNFgen: A generator of crafted benchmarks 5
Hardness of Approximation in PSPACE and Separation Results for Pebble Games 4
Tight size-degree bounds for sums-of-squares proofs 3
Trade-offs between time and memory in a tighter model of CDCL SAT solvers 1
The power of negative reasoning 1
Totale 2.449
Salva come PNG Salva come JPEG
Categoria #
all - tutte 4.603
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 4.603
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019449 0 0 11 5 35 0 1 32 2 80 171 112
2019/2020711 92 27 14 32 74 81 108 83 84 58 30 28
2020/2021200 22 37 11 6 2 2 5 25 44 33 12 1
2021/2022457 3 28 42 8 52 9 12 44 30 27 110 92
2022/2023385 82 91 22 31 42 35 0 19 45 1 12 5
2023/202488 20 39 29 0 0 0 0 0 0 0 0 0
Totale 2.449