|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov |
Parameterized Bounded-Depth Frege Is Not Optimal.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
Parameterized Complexity of DPLL Search Procedures. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Carlucci, Nicola Galesi, Massimo Lauria |
Paris-Harrington Tautologies. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Carlucci, Nicola Galesi, Massimo Lauria |
Paris-Harrington tautologies. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov |
Parameterized Bounded-Depth Frege is Not Optimal. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
Hardness of Parameterized Resolution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
On the Automatizability of Polynomial Calculus. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
Optimality of size-degree tradeoffs for polynomial calculus. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
On the Automatizability of Polynomial Calculus. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Massimo Lauria |
Random CNFs require spacious Polynomial Calculus refutations. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri |
Minimum-Energy Broadcast and disk cover in grid wireless networks. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
Extending Polynomial Calculus to $k$-DNF Resolution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri |
On the bounded-hop MST problem on random Euclidean instances. |
Theor. Comput. Sci. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri |
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. |
ADHOC-NOW |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri |
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. |
SIROCCO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri |
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. |
SIROCCO |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")