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
71
search results - page 15 / 15
»
Listing all the minimum spanning trees in an undirected grap...
Sort
relevance
views
votes
recent
update
View
thumb
title
33
click to vote
PODS
1994
ACM
138
views
Database
»
more
PODS 1994
»
Dyn-FO: A Parallel, Dynamic Complexity Class
14 years 15 days ago
Download
www.cs.umass.edu
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
claim paper
Read More »
« Prev
« First
page 15 / 15
Last »
Next »