Skip To Main Content
Bart Selman on Muck Rack

Bart Selman

As seen in: Nature, AI Magazine
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Bart

Contact Bart, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Computer Science > Artificial Intelligence

|
By Carla Gomes, Bart Selman, Stefan Szeider
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (700) Issue with article?

Zeitenwende — Turn of Eras

|
By Bart Selman, Meinolf Sellmann
| AI Magazine Verified
Authors Meinolf Sellmann GE Global Research Bart Selman Cornell University Abstract A new wave of innovation disrupts our social and economic life as we have lived it in the 20th century. On the one hand, artificial intelligence (AI) has the potential to increase our efficiency and ability to cope with the changes that are coming. On the other hand, AI itself also causes disruptions that may be managed best by contributions from other fields.
Open in Who Shared View Duplicates (15) Issue with article?

Determining computational complexity from characteristic ‘phase transitions’

|
By Scott Kirkpatrick, Rémi Monasson, Riccardo Zecchina, Bart Selman
| Nature Verified
Abstract Non-deterministic polynomial time (commonly termed ‘NP-complete’) problems are relevant to many computational tasks of practical interest—such as the ‘travelling salesman problem’—but are difficult to solve: the computing time grows exponentially with problem size in the worst case.
Open in Who Shared Issue with article?
See all 3 articles