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
1379
search results - page 14 / 276
»
The Complexity of the Annihilating Polynomial
Sort
relevance
views
votes
recent
update
View
thumb
title
60
click to vote
MFCS
2004
Springer
89
views
Theoretical Computer Science
»
more
MFCS 2004
»
Polynomial Time Approximation Schemes and Parameterized Complexity
15 years 3 months ago
Download
faculty.cs.tamu.edu
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
claim paper
Read More »
54
click to vote
ICALP
2010
Springer
102
views
Programming Languages
»
more
ICALP 2010
»
Exponential Time Complexity of the Permanent and the Tutte Polynomial
15 years 2 months ago
Download
www2.informatik.hu-berlin.de
Holger Dell, Thore Husfeldt, Martin Wahlen
claim paper
Read More »
62
click to vote
PODS
2009
ACM
98
views
Database
»
more
PODS 2009
»
XPath evaluation in linear time with polynomial combined complexity
15 years 2 months ago
Download
www.mimuw.edu.pl
Pawel Parys
claim paper
Read More »
33
click to vote
CORR
2006
Springer
70
views
Education
»
more
CORR 2006
»
The complexity of class polynomial computation via floating point approximations
14 years 10 months ago
Download
www.math.leidenuniv.nl
Andreas Enge
claim paper
Read More »
50
click to vote
CPC
2006
79
views
more
CPC 2006
»
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
14 years 10 months ago
Download
www-ma2.upc.edu
Omer Giménez, Marc Noy
claim paper
Read More »
« Prev
« First
page 14 / 276
Last »
Next »