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
2430
search results - page 24 / 486
»
Computing Tutte Polynomials
Sort
relevance
views
votes
recent
update
View
thumb
title
25
click to vote
FOCM
2007
76
views
more
FOCM 2007
»
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties
13 years 7 months ago
Download
math-www.uni-paderborn.de
Peter Bürgisser, Martin Lotz
claim paper
Read More »
17
click to vote
JSC
2000
62
views
more
JSC 2000
»
Galois Group Computation for Rational Polynomials
13 years 7 months ago
Download
www2.math.uni-paderborn.de
Katharina Geissler, Jürgen Klüners
claim paper
Read More »
12
click to vote
JSYML
2002
61
views
more
JSYML 2002
»
On Polynomial Time Computation over Unordered Structures
13 years 7 months ago
Download
shelah.logic.at
Andreas Blass, Yuri Gurevich, Saharon Shelah
claim paper
Read More »
17
click to vote
TOG
1998
58
views
more
TOG 1998
»
Computing Moments of Objects Enclosed by Piecewise Polynomial Surfaces
13 years 7 months ago
Download
www.cparity.com
Carlos Gonzalez-Ochoa, Scott McCammon, Jörg P...
claim paper
Read More »
19
click to vote
ICMS
2010
87
views
Software Engineering
»
more
ICMS 2010
»
New Algorithms for Computing Primary Decomposition of Polynomial Ideals
13 years 6 months ago
Download
www.math.kobe-u.ac.jp
Masayuki Noro
claim paper
Read More »
« Prev
« First
page 24 / 486
Last »
Next »