Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
537
search results - page 5 / 108
»
A new upper bound for 3-SAT
Sort
relevance
views
votes
recent
update
View
thumb
title
18
click to vote
WEA
2005
Springer
88
views
Algorithms
»
more
WEA 2005
»
New Upper Bound Heuristics for Treewidth
14 years 1 months ago
Download
www.cs.uu.nl
Emgad H. Bachoore, Hans L. Bodlaender
claim paper
Read More »
19
click to vote
CORR
2008
Springer
90
views
Education
»
more
CORR 2008
»
A New Upper Bound on the Capacity of a Class of Primitive Relay Channels
13 years 8 months ago
Download
www.ece.umd.edu
Ravi Tandon, Sennur Ulukus
claim paper
Read More »
19
click to vote
COMBINATORICS
2006
105
views
more
COMBINATORICS 2006
»
New Upper Bound for a Class of Vertex Folkman Numbers
13 years 8 months ago
Download
www.maths.tcd.ie
N. Kolev, N. Nenov
claim paper
Read More »
29
click to vote
COMBINATORICS
2007
84
views
more
COMBINATORICS 2007
»
A New Upper Bound on the Total Domination Number of a Graph
13 years 8 months ago
Download
www.combinatorics.org
Michael A. Henning, Anders Yeo
claim paper
Read More »
27
click to vote
JGT
2008
92
views
more
JGT 2008
»
A new upper bound for the bipartite Ramsey problem
13 years 8 months ago
Download
www.dpmms.cam.ac.uk
We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...
David Conlon
claim paper
Read More »
« Prev
« First
page 5 / 108
Last »
Next »